./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/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-2e94e6a [2018-12-31 03:27:12,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:27:12,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:27:12,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:27:12,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:27:12,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:27:12,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:27:12,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:27:12,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:27:12,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:27:12,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:27:12,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:27:12,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:27:12,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:27:12,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:27:12,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:27:12,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:27:12,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:27:12,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:27:12,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:27:12,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:27:12,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:27:12,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:27:12,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:27:12,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:27:12,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:27:12,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:27:12,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:27:12,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:27:12,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:27:12,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:27:12,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:27:12,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:27:12,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:27:12,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:27:12,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:27:12,977 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:27:12,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:27:12,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:27:12,993 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:27:12,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:27:12,994 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:27:12,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:27:12,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:27:12,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:27:12,995 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:27:12,996 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:27:12,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:27:12,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:27:12,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:27:12,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:27:12,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:27:12,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:27:12,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:27:12,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:27:12,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:27:13,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:27:13,000 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:27:13,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:27:13,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:27:13,001 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 [2018-12-31 03:27:13,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:27:13,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:27:13,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:27:13,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:27:13,085 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:27:13,087 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 [2018-12-31 03:27:13,158 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511265e0b/6eca61e02c584eb492545a2548b3695b/FLAG8e2fd53ea [2018-12-31 03:27:13,630 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:27:13,631 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-31 03:27:13,639 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511265e0b/6eca61e02c584eb492545a2548b3695b/FLAG8e2fd53ea [2018-12-31 03:27:14,004 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511265e0b/6eca61e02c584eb492545a2548b3695b [2018-12-31 03:27:14,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:27:14,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:27:14,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:27:14,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:27:14,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:27:14,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b62b0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14, skipping insertion in model container [2018-12-31 03:27:14,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:27:14,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:27:14,248 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:27:14,259 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:27:14,291 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:27:14,317 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:27:14,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14 WrapperNode [2018-12-31 03:27:14,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:27:14,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:27:14,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:27:14,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:27:14,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:27:14,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:27:14,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:27:14,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:27:14,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... [2018-12-31 03:27:14,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:27:14,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:27:14,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:27:14,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:27:14,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:27:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:27:14,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:27:15,038 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:27:15,038 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 03:27:15,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:27:15 BoogieIcfgContainer [2018-12-31 03:27:15,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:27:15,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:27:15,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:27:15,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:27:15,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:27:14" (1/3) ... [2018-12-31 03:27:15,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c7d176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:27:15, skipping insertion in model container [2018-12-31 03:27:15,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:14" (2/3) ... [2018-12-31 03:27:15,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c7d176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:27:15, skipping insertion in model container [2018-12-31 03:27:15,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:27:15" (3/3) ... [2018-12-31 03:27:15,046 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-31 03:27:15,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:27:15,066 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:27:15,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:27:15,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:27:15,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:27:15,126 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:27:15,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:27:15,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:27:15,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:27:15,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:27:15,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:27:15,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:27:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-31 03:27:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:27:15,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:15,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:15,167 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2018-12-31 03:27:15,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:27:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:27:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:27:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:27:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:27:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:27:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:27:15,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:27:15,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:27:15,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:27:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:27:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:27:15,406 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-12-31 03:27:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:27:15,525 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2018-12-31 03:27:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:27:15,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:27:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:27:15,539 INFO L225 Difference]: With dead ends: 51 [2018-12-31 03:27:15,539 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 03:27:15,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:27:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 03:27:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2018-12-31 03:27:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:27:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-31 03:27:15,578 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2018-12-31 03:27:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:27:15,578 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-31 03:27:15,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:27:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-31 03:27:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:27:15,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:15,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:15,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1984885586, now seen corresponding path program 1 times [2018-12-31 03:27:15,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:27:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:27:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:27:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:27:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:27:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:27:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:27:15,625 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:27:15,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:27:15 BoogieIcfgContainer [2018-12-31 03:27:15,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:27:15,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:27:15,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:27:15,660 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:27:15,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:27:15" (3/4) ... [2018-12-31 03:27:15,665 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:27:15,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:27:15,666 INFO L168 Benchmark]: Toolchain (without parser) took 1658.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -121.2 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,669 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:27:15,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.73 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,671 INFO L168 Benchmark]: Boogie Preprocessor took 122.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,672 INFO L168 Benchmark]: RCFGBuilder took 539.80 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,673 INFO L168 Benchmark]: TraceAbstraction took 620.19 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:27:15,674 INFO L168 Benchmark]: Witness Printer took 5.63 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. [2018-12-31 03:27:15,680 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.12 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.73 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 539.80 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 620.19 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.63 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.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s 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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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-2e94e6a [2018-12-31 03:27:18,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:27:18,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:27:18,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:27:18,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:27:18,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:27:18,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:27:18,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:27:18,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:27:18,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:27:18,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:27:18,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:27:18,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:27:18,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:27:18,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:27:18,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:27:18,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:27:18,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:27:18,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:27:18,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:27:18,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:27:18,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:27:18,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:27:18,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:27:18,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:27:18,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:27:18,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:27:18,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:27:18,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:27:18,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:27:18,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:27:18,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:27:18,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:27:18,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:27:18,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:27:18,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:27:18,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:27:18,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:27:18,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:27:18,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:27:18,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:27:18,096 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:27:18,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:27:18,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:27:18,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:27:18,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:27:18,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:27:18,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:27:18,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:27:18,099 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:27:18,099 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:27:18,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:27:18,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:27:18,101 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:27:18,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:27:18,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:27:18,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:27:18,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:27:18,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:27:18,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:27:18,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:27:18,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:27:18,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:27:18,106 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:27:18,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:27:18,106 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:27:18,106 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:27:18,106 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 [2018-12-31 03:27:18,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:27:18,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:27:18,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:27:18,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:27:18,189 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:27:18,190 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 [2018-12-31 03:27:18,262 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec2e8f28/bbc66cd8a9174c84af599bd16f19e3fa/FLAGd38063ec6 [2018-12-31 03:27:18,765 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:27:18,766 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-31 03:27:18,774 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec2e8f28/bbc66cd8a9174c84af599bd16f19e3fa/FLAGd38063ec6 [2018-12-31 03:27:19,112 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec2e8f28/bbc66cd8a9174c84af599bd16f19e3fa [2018-12-31 03:27:19,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:27:19,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:27:19,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:27:19,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:27:19,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:27:19,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7ece5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19, skipping insertion in model container [2018-12-31 03:27:19,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:27:19,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:27:19,411 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:27:19,420 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:27:19,469 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:27:19,495 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:27:19,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19 WrapperNode [2018-12-31 03:27:19,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:27:19,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:27:19,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:27:19,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:27:19,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:27:19,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:27:19,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:27:19,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:27:19,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... [2018-12-31 03:27:19,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:27:19,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:27:19,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:27:19,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:27:19,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:27:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:27:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:27:29,158 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:27:29,159 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 03:27:29,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:27:29 BoogieIcfgContainer [2018-12-31 03:27:29,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:27:29,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:27:29,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:27:29,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:27:29,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:27:19" (1/3) ... [2018-12-31 03:27:29,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c383dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:27:29, skipping insertion in model container [2018-12-31 03:27:29,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:27:19" (2/3) ... [2018-12-31 03:27:29,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c383dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:27:29, skipping insertion in model container [2018-12-31 03:27:29,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:27:29" (3/3) ... [2018-12-31 03:27:29,169 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-31 03:27:29,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:27:29,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:27:29,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:27:29,238 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:27:29,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:27:29,239 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:27:29,239 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:27:29,239 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:27:29,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:27:29,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:27:29,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:27:29,240 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:27:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-31 03:27:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:27:29,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:29,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:29,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2018-12-31 03:27:29,280 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:27:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:27:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:27:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:27:31,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:27:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:27:31,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:27:31,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:27:31,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:27:31,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:27:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:27:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:27:31,654 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-12-31 03:27:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:27:37,208 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2018-12-31 03:27:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:27:37,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:27:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:27:37,222 INFO L225 Difference]: With dead ends: 65 [2018-12-31 03:27:37,222 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 03:27:37,226 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 [2018-12-31 03:27:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 03:27:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2018-12-31 03:27:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:27:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-31 03:27:37,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2018-12-31 03:27:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:27:37,264 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-31 03:27:37,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:27:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-31 03:27:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:27:37,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:37,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:37,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2018-12-31 03:27:37,266 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:27:37,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:27:37,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:27:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:27:38,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:27:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:27:38,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:27:38,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:27:38,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:27:38,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:27:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:27:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:27:38,957 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 5 states. [2018-12-31 03:27:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:27:50,301 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2018-12-31 03:27:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:27:50,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-31 03:27:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:27:50,304 INFO L225 Difference]: With dead ends: 55 [2018-12-31 03:27:50,305 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:27:50,307 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 [2018-12-31 03:27:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:27:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-12-31 03:27:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:27:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 03:27:50,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2018-12-31 03:27:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:27:50,314 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 03:27:50,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:27:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 03:27:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:27:50,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:50,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:50,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2018-12-31 03:27:50,318 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:27:50,318 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:27:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:27:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:27:51,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:27:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:27:51,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:27:51,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:27:51,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:27:51,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:27:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:27:51,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:27:51,906 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-12-31 03:27:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:27:59,806 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-12-31 03:27:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:27:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:27:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:27:59,811 INFO L225 Difference]: With dead ends: 46 [2018-12-31 03:27:59,811 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 03:27:59,812 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 [2018-12-31 03:27:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 03:27:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-31 03:27:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:27:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 03:27:59,818 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2018-12-31 03:27:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:27:59,819 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 03:27:59,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:27:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 03:27:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:27:59,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:59,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:59,821 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2018-12-31 03:27:59,822 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:27:59,822 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 [2018-12-31 03:27:59,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:28:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:28:03,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:28:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:28:04,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:28:04,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:28:04,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:28:04,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:28:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:28:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:28:04,506 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2018-12-31 03:28:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:28:17,874 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-12-31 03:28:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:28:17,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 03:28:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:28:17,876 INFO L225 Difference]: With dead ends: 64 [2018-12-31 03:28:17,876 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 03:28:17,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:28:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 03:28:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-12-31 03:28:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 03:28:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-31 03:28:17,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-12-31 03:28:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:28:17,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-31 03:28:17,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:28:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-31 03:28:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:28:17,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:28:17,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:28:17,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:28:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:28:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2018-12-31 03:28:17,902 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:28:17,902 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) [2018-12-31 03:28:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:28:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:28:21,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:28:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:28:21,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:28:21,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:28:21,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:28:21,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:28:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:28:21,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:28:21,997 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-12-31 03:28:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:28:25,033 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-12-31 03:28:25,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:28:25,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:28:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:28:25,035 INFO L225 Difference]: With dead ends: 54 [2018-12-31 03:28:25,035 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 03:28:25,036 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 [2018-12-31 03:28:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 03:28:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-12-31 03:28:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 03:28:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-31 03:28:25,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2018-12-31 03:28:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:28:25,045 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-31 03:28:25,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:28:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-31 03:28:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:28:25,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:28:25,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:28:25,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:28:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:28:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2018-12-31 03:28:25,047 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:28:25,048 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 [2018-12-31 03:28:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:28:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:28:29,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:28:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:28:29,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:28:31,733 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 [2018-12-31 03:28:35,646 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 [2018-12-31 03:28:38,327 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 [2018-12-31 03:28:40,862 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 [2018-12-31 03:28:43,385 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 [2018-12-31 03:28:45,939 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 [2018-12-31 03:28:48,506 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 [2018-12-31 03:28:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-31 03:28:48,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:28:48,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-31 03:28:48,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 03:28:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 03:28:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-12-31 03:28:48,591 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-12-31 03:28:51,138 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 [2018-12-31 03:28:53,699 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 [2018-12-31 03:28:56,413 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 [2018-12-31 03:29:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:29:31,149 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2018-12-31 03:29:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:29:31,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-31 03:29:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:29:31,546 INFO L225 Difference]: With dead ends: 97 [2018-12-31 03:29:31,546 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 03:29:31,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-12-31 03:29:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 03:29:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2018-12-31 03:29:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 03:29:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-12-31 03:29:31,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2018-12-31 03:29:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:29:31,562 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-12-31 03:29:31,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 03:29:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-12-31 03:29:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:29:31,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:29:31,563 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] [2018-12-31 03:29:31,565 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:29:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:29:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1075575453, now seen corresponding path program 1 times [2018-12-31 03:29:31,566 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:29:31,566 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) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:29:31,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:29:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:29:38,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:29:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:29:38,238 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:29:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:29:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:29:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:29:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:29:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:29:38,320 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2018-12-31 03:29:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:29:45,981 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2018-12-31 03:29:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:29:46,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-31 03:29:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:29:46,492 INFO L225 Difference]: With dead ends: 66 [2018-12-31 03:29:46,492 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 03:29:46,493 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 [2018-12-31 03:29:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 03:29:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-31 03:29:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 03:29:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-31 03:29:46,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2018-12-31 03:29:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:29:46,516 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-31 03:29:46,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:29:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-31 03:29:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:29:46,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:29:46,518 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] [2018-12-31 03:29:46,518 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:29:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:29:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash 340173568, now seen corresponding path program 1 times [2018-12-31 03:29:46,519 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:29:46,519 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 [2018-12-31 03:29:46,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:29:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:29:52,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:29:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 03:29:53,156 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:29:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:29:53,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:29:53,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:29:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:29:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:29:53,240 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 7 states. [2018-12-31 03:30:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:30:00,175 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-12-31 03:30:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:30:00,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 03:30:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:30:00,178 INFO L225 Difference]: With dead ends: 73 [2018-12-31 03:30:00,178 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 03:30:00,179 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 [2018-12-31 03:30:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 03:30:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-31 03:30:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 03:30:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-31 03:30:00,192 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2018-12-31 03:30:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:30:00,193 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-31 03:30:00,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:30:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-12-31 03:30:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 03:30:00,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:30:00,194 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] [2018-12-31 03:30:00,194 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:30:00,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:30:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash 13709678, now seen corresponding path program 1 times [2018-12-31 03:30:00,195 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:30:00,195 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 [2018-12-31 03:30:00,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:30:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:30:06,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:30:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:30:06,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:30:09,014 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 [2018-12-31 03:30:11,111 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 [2018-12-31 03:30:13,606 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 [2018-12-31 03:30:16,083 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 [2018-12-31 03:30:18,562 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 [2018-12-31 03:30:21,041 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 [2018-12-31 03:30:23,563 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 [2018-12-31 03:30:26,059 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 [2018-12-31 03:30:39,162 WARN L181 SmtUtils]: Spent 3.81 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 03:30:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-12-31 03:30:39,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:30:39,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-31 03:30:39,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 03:30:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 03:30:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=11, NotChecked=76, Total=182 [2018-12-31 03:30:39,266 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 14 states. [2018-12-31 03:30:41,814 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 [2018-12-31 03:30:44,313 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 [2018-12-31 03:30:46,803 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 [2018-12-31 03:30:48,907 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 [2018-12-31 03:31:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:31:28,412 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-12-31 03:31:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:31:28,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-12-31 03:31:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:31:28,418 INFO L225 Difference]: With dead ends: 90 [2018-12-31 03:31:28,418 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 03:31:28,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=43, Invalid=64, Unknown=15, NotChecked=184, Total=306 [2018-12-31 03:31:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 03:31:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-12-31 03:31:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 03:31:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-12-31 03:31:28,435 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2018-12-31 03:31:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:31:28,436 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-12-31 03:31:28,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 03:31:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-12-31 03:31:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 03:31:28,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:31:28,439 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] [2018-12-31 03:31:28,439 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:31:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:31:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1340342541, now seen corresponding path program 1 times [2018-12-31 03:31:28,440 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:31:28,440 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 [2018-12-31 03:31:28,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:31:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:31:33,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:31:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:31:33,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:31:36,715 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 03:31:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:31:36,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:31:36,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-31 03:31:36,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:31:36,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:31:36,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:31:36,807 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 8 states. [2018-12-31 03:31:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:31:49,863 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2018-12-31 03:31:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:31:49,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-31 03:31:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:31:49,866 INFO L225 Difference]: With dead ends: 85 [2018-12-31 03:31:49,866 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 03:31:49,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:31:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 03:31:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-12-31 03:31:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 03:31:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-31 03:31:49,887 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2018-12-31 03:31:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:31:49,887 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-31 03:31:49,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:31:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-31 03:31:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 03:31:49,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:31:49,890 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] [2018-12-31 03:31:49,892 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:31:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:31:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -426284202, now seen corresponding path program 1 times [2018-12-31 03:31:49,893 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:31:49,894 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 [2018-12-31 03:31:49,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:31:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:31:58,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:31:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 03:31:58,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:31:58,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:31:58,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:31:58,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:31:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:31:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:31:58,597 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-12-31 03:32:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:32:09,383 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-12-31 03:32:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:32:09,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 03:32:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:32:09,741 INFO L225 Difference]: With dead ends: 72 [2018-12-31 03:32:09,741 INFO L226 Difference]: Without dead ends: 47 [2018-12-31 03:32:09,741 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 [2018-12-31 03:32:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-31 03:32:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-31 03:32:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 03:32:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-31 03:32:09,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 33 [2018-12-31 03:32:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:32:09,763 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-31 03:32:09,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:32:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-31 03:32:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 03:32:09,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:32:09,767 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] [2018-12-31 03:32:09,767 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:32:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:32:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash 119314739, now seen corresponding path program 1 times [2018-12-31 03:32:09,768 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:32:09,768 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 [2018-12-31 03:32:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:32:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:32:18,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:32:20,966 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))))) is different from true [2018-12-31 03:32:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-31 03:32:21,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:32:23,442 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 [2018-12-31 03:32:25,822 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 [2018-12-31 03:32:28,649 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 [2018-12-31 03:32:31,409 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 [2018-12-31 03:32:34,177 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 [2018-12-31 03:32:36,969 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 [2018-12-31 03:32:39,748 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 [2018-12-31 03:32:42,536 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 [2018-12-31 03:32:43,551 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-31 03:32:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-12-31 03:32:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:32:43,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-31 03:32:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 03:32:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 03:32:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=50, Unknown=9, NotChecked=90, Total=182 [2018-12-31 03:32:43,663 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 14 states. [2018-12-31 03:32:46,524 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 [2018-12-31 03:32:49,393 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 [2018-12-31 03:32:52,253 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 [2018-12-31 03:32:54,577 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 [2018-12-31 03:32:57,352 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 [2018-12-31 03:33:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:33:33,221 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-12-31 03:33:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:33:33,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-31 03:33:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:33:33,224 INFO L225 Difference]: With dead ends: 83 [2018-12-31 03:33:33,224 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 03:33:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=41, Invalid=53, Unknown=14, NotChecked=198, Total=306 [2018-12-31 03:33:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 03:33:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-12-31 03:33:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 03:33:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-31 03:33:33,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2018-12-31 03:33:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:33:33,251 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-31 03:33:33,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 03:33:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-31 03:33:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 03:33:33,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:33:33,252 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] [2018-12-31 03:33:33,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:33:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:33:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash 346299736, now seen corresponding path program 2 times [2018-12-31 03:33:33,256 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:33:33,256 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) [2018-12-31 03:33:33,262 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-31 03:33:43,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 03:33:43,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 03:33:44,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:33:47,645 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 [2018-12-31 03:34:00,160 WARN L181 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 03:34:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2018-12-31 03:34:00,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:34:32,588 WARN L181 SmtUtils]: Spent 4.77 s on a formula simplification that was a NOOP. DAG size: 6 [2018-12-31 03:34:35,360 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 [2018-12-31 03:34:38,071 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 [2018-12-31 03:34:41,097 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 [2018-12-31 03:34:44,075 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 [2018-12-31 03:34:46,779 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-31 03:34:46,980 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2018-12-31 03:34:46,982 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 [2018-12-31 03:34:46,992 INFO L168 Benchmark]: Toolchain (without parser) took 447875.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -67.0 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:46,996 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:34:46,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:46,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:46,998 INFO L168 Benchmark]: Boogie Preprocessor took 92.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:47,001 INFO L168 Benchmark]: RCFGBuilder took 9528.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:47,001 INFO L168 Benchmark]: TraceAbstraction took 437831.19 ms. Allocated memory was 1.1 GB in the beginning and 1.1 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: 72.0 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:34:47,012 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9528.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 437831.19 ms. Allocated memory was 1.1 GB in the beginning and 1.1 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: 72.0 MB). Peak memory consumption was 67.8 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...