./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ............................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-1dbac8b [2018-11-10 03:37:38,536 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:37:38,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:37:38,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:37:38,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:37:38,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:37:38,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:37:38,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:37:38,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:37:38,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:37:38,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:37:38,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:37:38,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:37:38,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:37:38,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:37:38,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:37:38,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:37:38,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:37:38,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:37:38,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:37:38,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:37:38,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:37:38,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:37:38,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:37:38,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:37:38,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:37:38,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:37:38,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:37:38,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:37:38,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:37:38,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:37:38,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:37:38,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:37:38,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:37:38,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:37:38,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:37:38,566 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:37:38,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:37:38,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:37:38,577 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:37:38,577 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:37:38,577 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:37:38,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:37:38,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:37:38,577 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:37:38,578 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:37:38,578 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:37:38,578 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:37:38,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:37:38,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:37:38,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:37:38,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:37:38,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:37:38,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:37:38,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan 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 -> Taipan 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 -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-10 03:37:38,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:37:38,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:37:38,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:37:38,618 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:37:38,619 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:37:38,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:38,659 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/1712edbb7/1be61d3054424e73b4f583a1b125ff85/FLAG5e082a8f4 [2018-11-10 03:37:38,949 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:37:38,950 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:38,955 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/1712edbb7/1be61d3054424e73b4f583a1b125ff85/FLAG5e082a8f4 [2018-11-10 03:37:38,963 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/1712edbb7/1be61d3054424e73b4f583a1b125ff85 [2018-11-10 03:37:38,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:37:38,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:37:38,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:38,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:37:38,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:37:38,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:38" (1/1) ... [2018-11-10 03:37:38,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:38, skipping insertion in model container [2018-11-10 03:37:38,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:38" (1/1) ... [2018-11-10 03:37:38,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:37:38,990 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:37:39,093 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:39,096 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:37:39,110 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:39,119 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:37:39,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39 WrapperNode [2018-11-10 03:37:39,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:39,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:39,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:37:39,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:37:39,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:39,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:37:39,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:37:39,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:37:39,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... [2018-11-10 03:37:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:37:39,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:37:39,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:37:39,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:37:39,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:37:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:37:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:37:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 03:37:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-10 03:37:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:37:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:37:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:37:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:37:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:37:39,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 03:37:39,366 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:37:39,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:39 BoogieIcfgContainer [2018-11-10 03:37:39,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:37:39,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:37:39,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:37:39,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:37:39,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:37:38" (1/3) ... [2018-11-10 03:37:39,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c53496a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:37:39, skipping insertion in model container [2018-11-10 03:37:39,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:39" (2/3) ... [2018-11-10 03:37:39,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c53496a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:37:39, skipping insertion in model container [2018-11-10 03:37:39,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:39" (3/3) ... [2018-11-10 03:37:39,373 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:39,380 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:37:39,384 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:37:39,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:37:39,424 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:37:39,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:37:39,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:37:39,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:37:39,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:37:39,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:37:39,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:37:39,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:37:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 03:37:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 03:37:39,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:37:39,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:39,448 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:37:39,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-10 03:37:39,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:37:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:39,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:37:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:39,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:37:39,543 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:37:39,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:37:39,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:37:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:37:39,559 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-10 03:37:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:39,579 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-10 03:37:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:37:39,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 03:37:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:37:39,587 INFO L225 Difference]: With dead ends: 56 [2018-11-10 03:37:39,587 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 03:37:39,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:37:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 03:37:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 03:37:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 03:37:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-10 03:37:39,612 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-10 03:37:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:37:39,612 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 03:37:39,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:37:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-10 03:37:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:37:39,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:37:39,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:39,613 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:37:39,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-10 03:37:39,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:37:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:39,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:37:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:39,650 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 03:37:39,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:37:39 BoogieIcfgContainer [2018-11-10 03:37:39,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:37:39,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:37:39,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:37:39,672 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:37:39,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:39" (3/4) ... [2018-11-10 03:37:39,675 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:37:39,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:37:39,675 INFO L168 Benchmark]: Toolchain (without parser) took 709.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:37:39,677 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:37:39,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:37:39,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:37:39,678 INFO L168 Benchmark]: Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:37:39,678 INFO L168 Benchmark]: RCFGBuilder took 219.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:37:39,679 INFO L168 Benchmark]: TraceAbstraction took 304.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:37:39,679 INFO L168 Benchmark]: Witness Printer took 3.16 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-11-10 03:37:39,682 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 219.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 304.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 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: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000, d=1] [L46] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L48] CALL, EXPR SqrtR(d) VAL [\old(Input)=1, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L39] RET return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] EXPR SqrtR(d) VAL [_EPS=1/1000000, d=1, SqrtR(d)=3] [L48] r = SqrtR(d) [L50] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 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.23-1dbac8b [2018-11-10 03:37:41,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:37:41,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:37:41,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:37:41,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:37:41,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:37:41,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:37:41,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:37:41,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:37:41,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:37:41,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:37:41,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:37:41,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:37:41,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:37:41,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:37:41,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:37:41,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:37:41,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:37:41,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:37:41,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:37:41,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:37:41,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:37:41,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:37:41,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:37:41,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:37:41,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:37:41,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:37:41,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:37:41,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:37:41,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:37:41,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:37:41,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:37:41,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:37:41,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:37:41,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:37:41,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:37:41,104 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 03:37:41,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:37:41,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:37:41,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:37:41,115 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:37:41,115 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:37:41,115 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:37:41,115 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:37:41,115 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:37:41,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:37:41,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:37:41,117 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:37:41,117 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:37:41,117 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:37:41,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:37:41,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:37:41,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:37:41,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:37:41,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:37:41,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:37:41,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:37:41,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:37:41,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:37:41,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:37:41,119 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 03:37:41,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:37:41,119 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:37:41,119 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:37:41,119 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan 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 -> Taipan 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 -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-10 03:37:41,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:37:41,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:37:41,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:37:41,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:37:41,164 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:37:41,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:41,208 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/330afe887/3370e572709e4a0ebcfce30e7a16783a/FLAGc55e3f388 [2018-11-10 03:37:41,511 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:37:41,511 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:41,515 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/330afe887/3370e572709e4a0ebcfce30e7a16783a/FLAGc55e3f388 [2018-11-10 03:37:41,523 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/data/330afe887/3370e572709e4a0ebcfce30e7a16783a [2018-11-10 03:37:41,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:37:41,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:37:41,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:41,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:37:41,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:37:41,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98713a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41, skipping insertion in model container [2018-11-10 03:37:41,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:37:41,550 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:37:41,655 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:41,660 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:37:41,675 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:41,685 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:37:41,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41 WrapperNode [2018-11-10 03:37:41,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:41,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:41,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:37:41,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:37:41,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:41,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:37:41,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:37:41,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:37:41,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... [2018-11-10 03:37:41,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:37:41,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:37:41,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:37:41,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:37:41,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:37:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:37:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:37:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 03:37:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-10 03:37:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:37:41,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:37:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:37:41,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:37:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:37:41,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 03:37:49,864 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:37:49,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:49 BoogieIcfgContainer [2018-11-10 03:37:49,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:37:49,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:37:49,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:37:49,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:37:49,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:37:41" (1/3) ... [2018-11-10 03:37:49,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19da4042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:37:49, skipping insertion in model container [2018-11-10 03:37:49,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:41" (2/3) ... [2018-11-10 03:37:49,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19da4042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:37:49, skipping insertion in model container [2018-11-10 03:37:49,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:49" (3/3) ... [2018-11-10 03:37:49,870 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-10 03:37:49,876 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:37:49,881 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:37:49,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:37:49,909 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:37:49,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:37:49,910 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:37:49,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:37:49,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:37:49,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:37:49,911 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:37:49,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:37:49,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:37:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 03:37:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 03:37:49,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:37:49,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:49,927 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:37:49,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-10 03:37:49,933 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:37:49,933 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:37:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:51,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:37:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:51,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:37:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:51,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:37:51,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:37:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:37:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:37:51,181 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-10 03:37:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:51,196 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-10 03:37:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:37:51,197 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 03:37:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:37:51,204 INFO L225 Difference]: With dead ends: 56 [2018-11-10 03:37:51,204 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 03:37:51,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:37:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 03:37:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 03:37:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 03:37:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-10 03:37:51,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-10 03:37:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:37:51,232 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 03:37:51,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:37:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-10 03:37:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:37:51,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:37:51,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:51,233 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:37:51,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-10 03:37:51,234 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:37:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:37:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:52,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:37:58,372 WARN L179 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-10 03:37:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:58,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:37:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:58,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:37:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:58,398 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-10 03:38:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:06,272 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-10 03:38:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:38:06,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 03:38:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:06,274 INFO L225 Difference]: With dead ends: 49 [2018-11-10 03:38:06,274 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 03:38:06,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 03:38:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 03:38:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 03:38:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 03:38:06,279 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-11-10 03:38:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:06,279 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 03:38:06,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:38:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 03:38:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:38:06,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:06,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:06,281 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:06,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-11-10 03:38:06,281 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:38:06,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:38:06,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:08,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:08,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:38:08,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:38:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:38:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:08,170 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-11-10 03:38:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:13,022 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-10 03:38:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:38:13,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 03:38:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:13,025 INFO L225 Difference]: With dead ends: 63 [2018-11-10 03:38:13,026 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 03:38:13,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:38:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 03:38:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-10 03:38:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 03:38:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 03:38:13,037 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-11-10 03:38:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:13,037 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 03:38:13,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:38:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 03:38:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 03:38:13,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:13,039 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:13,039 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:13,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-11-10 03:38:13,040 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:38:13,040 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:38:13,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:16,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:18,680 WARN L832 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-11-10 03:38:20,795 WARN L854 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-11-10 03:38:23,175 WARN L832 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from false [2018-11-10 03:38:25,562 WARN L854 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from true [2018-11-10 03:38:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 03:38:25,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:47,960 WARN L179 SmtUtils]: Spent 22.13 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 03:39:05,069 WARN L179 SmtUtils]: Spent 17.11 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 03:39:29,942 WARN L179 SmtUtils]: Spent 24.87 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 03:39:54,794 WARN L179 SmtUtils]: Spent 24.85 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 03:39:57,240 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-11-10 03:39:59,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-11-10 03:40:02,112 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from false [2018-11-10 03:40:04,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from true [2018-11-10 03:40:07,308 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from false [2018-11-10 03:40:10,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from true [2018-11-10 03:40:12,981 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from false [2018-11-10 03:40:15,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from true [2018-11-10 03:40:18,724 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from false [2018-11-10 03:40:21,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from true [2018-11-10 03:40:23,986 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse3 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) RNE 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-11-10 03:40:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 03:40:24,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:40:24,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:40:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:40:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 03:40:38,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-10 03:40:38,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 03:40:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 03:40:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-10 03:40:38,382 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-11-10 03:40:40,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= .cse0 c_main_~d~0) (fp.leq .cse1 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2018-11-10 03:40:43,331 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from false [2018-11-10 03:40:46,179 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from true [2018-11-10 03:40:48,623 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from false [2018-11-10 03:40:51,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from true [2018-11-10 03:40:54,025 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from false [2018-11-10 03:40:56,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from true [2018-11-10 03:41:02,147 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from false [2018-11-10 03:41:04,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from true [2018-11-10 03:41:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:04,916 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-10 03:41:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:41:04,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-11-10 03:41:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:41:04,918 INFO L225 Difference]: With dead ends: 55 [2018-11-10 03:41:04,918 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 03:41:04,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 62.1s TimeCoverageRelationStatistics Valid=58, Invalid=149, Unknown=23, NotChecked=420, Total=650 [2018-11-10 03:41:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 03:41:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-10 03:41:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 03:41:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 03:41:04,929 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-10 03:41:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:41:04,929 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 03:41:04,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 03:41:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 03:41:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 03:41:04,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:41:04,930 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:04,931 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:41:04,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 801057869, now seen corresponding path program 1 times [2018-11-10 03:41:04,931 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:41:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:41:04,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:09,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:41:09,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:41:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:41:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:41:09,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:41:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:41:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:41:09,553 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-11-10 03:41:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:17,398 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-11-10 03:41:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:41:17,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-10 03:41:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:41:17,400 INFO L225 Difference]: With dead ends: 89 [2018-11-10 03:41:17,400 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 03:41:17,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:41:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 03:41:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 03:41:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 03:41:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 03:41:17,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-10 03:41:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:41:17,407 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 03:41:17,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:41:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 03:41:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:41:17,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:41:17,408 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:17,408 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:41:17,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-11-10 03:41:17,409 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:41:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2b44809-7dab-461d-b0b7-ef202f6b745c/bin-2019/utaipan/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-11-10 03:41:17,411 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:41:22,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:41:22,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:41:23,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:25,366 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-11-10 03:41:27,503 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-11-10 03:41:29,923 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from false [2018-11-10 03:41:32,324 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from true [2018-11-10 03:41:35,058 WARN L832 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from false [2018-11-10 03:41:37,766 WARN L854 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from true [2018-11-10 03:41:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-10 03:41:37,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:41:50,807 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 03:41:51,008 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2018-11-10 03:41:51,009 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeSummaryForInterproceduralTrace(IterativePredicateTransformer.java:563) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeProcedureSummary(IterativePredicateTransformer.java:483) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:369) 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:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) ... 46 more [2018-11-10 03:41:51,011 INFO L168 Benchmark]: Toolchain (without parser) took 249484.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 949.8 MB in the beginning and 913.0 MB in the end (delta: 36.8 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:51,012 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:41:51,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.8 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:51,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.55 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:51,013 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:41:51,013 INFO L168 Benchmark]: RCFGBuilder took 8145.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:51,014 INFO L168 Benchmark]: TraceAbstraction took 241144.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 196.8 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:51,016 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.8 MB in the beginning and 939.0 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 13.55 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8145.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 241144.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 196.8 MB). Peak memory consumption was 196.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...