./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5842f4b [2018-11-18 11:37:11,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:37:11,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:37:11,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:37:11,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:37:11,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:37:11,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:37:11,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:37:11,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:37:11,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:37:11,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:37:11,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:37:11,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:37:11,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:37:11,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:37:11,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:37:11,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:37:11,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:37:11,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:37:11,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:37:11,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:37:11,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:37:11,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:37:11,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:37:11,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:37:11,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:37:11,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:37:11,165 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:37:11,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:37:11,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:37:11,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:37:11,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:37:11,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:37:11,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:37:11,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:37:11,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:37:11,169 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 11:37:11,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:37:11,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:37:11,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:37:11,179 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:37:11,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:37:11,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:37:11,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:37:11,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:37:11,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:37:11,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:37:11,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:37:11,182 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_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-18 11:37:11,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:37:11,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:37:11,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:37:11,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:37:11,215 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:37:11,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:11,254 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a75fc1772/3ba7dc8b72784511abd5b609067b2871/FLAG7123cc839 [2018-11-18 11:37:11,652 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:37:11,653 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:11,657 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a75fc1772/3ba7dc8b72784511abd5b609067b2871/FLAG7123cc839 [2018-11-18 11:37:11,668 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a75fc1772/3ba7dc8b72784511abd5b609067b2871 [2018-11-18 11:37:11,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:37:11,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:37:11,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:11,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:37:11,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:37:11,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4959e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11, skipping insertion in model container [2018-11-18 11:37:11,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:37:11,698 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:37:11,814 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:11,817 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:37:11,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:11,840 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:37:11,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11 WrapperNode [2018-11-18 11:37:11,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:11,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:37:11,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:37:11,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:37:11,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... [2018-11-18 11:37:11,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:37:11,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:37:11,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:37:11,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:37:11,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:37:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:37:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:37:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-18 11:37:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:37:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:37:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:37:12,050 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:37:12,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:12 BoogieIcfgContainer [2018-11-18 11:37:12,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:37:12,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:37:12,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:37:12,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:37:12,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:37:11" (1/3) ... [2018-11-18 11:37:12,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db71b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:12, skipping insertion in model container [2018-11-18 11:37:12,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:11" (2/3) ... [2018-11-18 11:37:12,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db71b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:12, skipping insertion in model container [2018-11-18 11:37:12,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:12" (3/3) ... [2018-11-18 11:37:12,058 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:12,066 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:37:12,072 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:37:12,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:37:12,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:37:12,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:37:12,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:37:12,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:37:12,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:37:12,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:37:12,109 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:37:12,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:37:12,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:37:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-18 11:37:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:37:12,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:12,130 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-18 11:37:12,132 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:12,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-18 11:37:12,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:12,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:12,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:12,219 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-18 11:37:12,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:37:12,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:37:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:37:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:37:12,234 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-18 11:37:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:12,248 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 11:37:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:37:12,249 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 11:37:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:37:12,254 INFO L225 Difference]: With dead ends: 56 [2018-11-18 11:37:12,254 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 11:37:12,256 INFO L604 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-18 11:37:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 11:37:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 11:37:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:37:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 11:37:12,280 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-18 11:37:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:37:12,280 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 11:37:12,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:37:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 11:37:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:37:12,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:12,281 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-18 11:37:12,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:12,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-18 11:37:12,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:12,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:12,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:12,309 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 11:37:12,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:37:12 BoogieIcfgContainer [2018-11-18 11:37:12,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:37:12,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:37:12,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:37:12,327 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:37:12,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:12" (3/4) ... [2018-11-18 11:37:12,330 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:37:12,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:37:12,331 INFO L168 Benchmark]: Toolchain (without parser) took 660.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:12,332 INFO L168 Benchmark]: CDTParser took 0.10 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-18 11:37:12,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:12,332 INFO L168 Benchmark]: Boogie Preprocessor took 22.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:12,333 INFO L168 Benchmark]: RCFGBuilder took 187.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:12,334 INFO L168 Benchmark]: TraceAbstraction took 275.21 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:12,334 INFO L168 Benchmark]: Witness Printer took 2.94 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-18 11:37:12,337 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.10 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 168.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275.21 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 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-5842f4b [2018-11-18 11:37:13,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:37:13,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:37:13,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:37:13,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:37:13,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:37:13,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:37:13,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:37:13,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:37:13,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:37:13,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:37:13,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:37:13,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:37:13,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:37:13,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:37:13,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:37:13,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:37:13,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:37:13,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:37:13,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:37:13,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:37:13,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:37:13,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:37:13,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:37:13,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:37:13,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:37:13,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:37:13,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:37:13,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:37:13,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:37:13,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:37:13,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:37:13,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:37:13,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:37:13,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:37:13,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:37:13,826 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 11:37:13,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:37:13,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:37:13,838 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:37:13,838 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:37:13,838 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:37:13,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:37:13,839 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:37:13,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:37:13,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:37:13,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 11:37:13,841 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 11:37:13,841 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_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-18 11:37:13,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:37:13,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:37:13,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:37:13,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:37:13,879 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:37:13,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:13,915 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a55e06eb6/80b9ccace50548408a4d66f663fe7c8b/FLAGf8d0ec4dc [2018-11-18 11:37:14,313 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:37:14,314 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:14,318 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a55e06eb6/80b9ccace50548408a4d66f663fe7c8b/FLAGf8d0ec4dc [2018-11-18 11:37:14,327 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/data/a55e06eb6/80b9ccace50548408a4d66f663fe7c8b [2018-11-18 11:37:14,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:37:14,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:37:14,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:14,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:37:14,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:37:14,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15007527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14, skipping insertion in model container [2018-11-18 11:37:14,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:37:14,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:37:14,479 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:14,484 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:37:14,501 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:14,511 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:37:14,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14 WrapperNode [2018-11-18 11:37:14,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:14,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:37:14,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:37:14,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:37:14,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... [2018-11-18 11:37:14,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:37:14,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:37:14,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:37:14,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:37:14,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:37:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:37:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:37:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-18 11:37:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:37:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:37:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 11:37:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 11:37:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:37:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 11:37:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:37:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:37:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:37:23,555 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:37:23,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:23 BoogieIcfgContainer [2018-11-18 11:37:23,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:37:23,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:37:23,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:37:23,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:37:23,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:37:14" (1/3) ... [2018-11-18 11:37:23,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a15a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:23, skipping insertion in model container [2018-11-18 11:37:23,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:14" (2/3) ... [2018-11-18 11:37:23,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a15a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:23, skipping insertion in model container [2018-11-18 11:37:23,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:23" (3/3) ... [2018-11-18 11:37:23,564 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:37:23,573 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:37:23,580 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:37:23,591 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:37:23,612 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:37:23,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:37:23,613 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:37:23,613 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:37:23,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:37:23,613 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:37:23,613 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:37:23,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:37:23,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:37:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-18 11:37:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:37:23,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:23,630 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-18 11:37:23,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:23,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-18 11:37:23,638 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:37:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:24,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:24,990 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-18 11:37:24,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:37:25,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:25,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:37:25,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:37:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:37:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:37:25,030 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-18 11:37:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:25,048 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 11:37:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:37:25,049 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 11:37:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:37:25,055 INFO L225 Difference]: With dead ends: 56 [2018-11-18 11:37:25,055 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 11:37:25,058 INFO L604 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-18 11:37:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 11:37:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 11:37:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:37:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 11:37:25,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-18 11:37:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:37:25,083 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 11:37:25,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:37:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 11:37:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:37:25,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:25,084 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-18 11:37:25,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:25,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-18 11:37:25,085 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:37:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:25,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:26,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:32,603 WARN L180 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-18 11:37:32,608 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-18 11:37:32,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:37:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:32,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:37:32,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:37:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:37:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:37:32,636 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-18 11:37:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:38,632 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-18 11:37:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:37:38,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 11:37:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:37:38,634 INFO L225 Difference]: With dead ends: 49 [2018-11-18 11:37:38,634 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 11:37:38,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:37:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 11:37:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 11:37:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:37:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 11:37:38,640 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-11-18 11:37:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:37:38,641 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 11:37:38,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:37:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 11:37:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:37:38,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:38,642 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-18 11:37:38,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:38,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-11-18 11:37:38,643 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:37:38,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:40,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:40,610 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-18 11:37:40,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:37:40,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:37:40,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:37:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:37:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:37:40,639 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-11-18 11:37:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:48,612 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-18 11:37:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:37:48,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 11:37:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:37:48,616 INFO L225 Difference]: With dead ends: 63 [2018-11-18 11:37:48,616 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 11:37:48,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-18 11:37:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 11:37:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-18 11:37:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 11:37:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 11:37:48,627 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-11-18 11:37:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:37:48,628 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 11:37:48,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:37:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 11:37:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:37:48,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:37:48,629 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-18 11:37:48,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:37:48,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-11-18 11:37:48,630 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:37:48,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/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-18 11:37:48,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:52,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:54,255 WARN L832 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-11-18 11:37:56,372 WARN L854 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-11-18 11:37:58,773 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from false [2018-11-18 11:38:01,180 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from true [2018-11-18 11:38:01,282 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-18 11:38:01,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:38:23,711 WARN L180 SmtUtils]: Spent 22.31 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 11:38:40,552 WARN L180 SmtUtils]: Spent 16.84 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 11:39:06,430 WARN L180 SmtUtils]: Spent 25.88 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 11:39:32,425 WARN L180 SmtUtils]: Spent 25.99 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 11:39:34,875 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-11-18 11:39:37,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-11-18 11:39:39,830 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from false [2018-11-18 11:39:42,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from true [2018-11-18 11:39:45,042 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from false [2018-11-18 11:39:47,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from true [2018-11-18 11:39:50,785 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from false [2018-11-18 11:39:53,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from true [2018-11-18 11:39:56,622 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from false [2018-11-18 11:39:59,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from true [2018-11-18 11:40:02,077 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-11-18 11:40:02,108 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-18 11:40:02,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:40:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-18 11:40:02,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 11:40:02,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 11:40:02,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-18 11:40:02,155 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-11-18 11:40:04,605 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from false [2018-11-18 11:40:07,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from true [2018-11-18 11:40:09,504 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from false [2018-11-18 11:40:12,313 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from true [2018-11-18 11:40:14,826 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from false [2018-11-18 11:40:17,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from true [2018-11-18 11:40:20,262 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from false [2018-11-18 11:40:23,037 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from true [2018-11-18 11:40:30,383 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from false [2018-11-18 11:40:32,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from true [2018-11-18 11:40:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:33,150 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-18 11:40:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:33,151 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-11-18 11:40:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:33,152 INFO L225 Difference]: With dead ends: 55 [2018-11-18 11:40:33,152 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 11:40:33,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=58, Invalid=148, Unknown=24, NotChecked=420, Total=650 [2018-11-18 11:40:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 11:40:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-18 11:40:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:40:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 11:40:33,163 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-18 11:40:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:33,164 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 11:40:33,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 11:40:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 11:40:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:40:33,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:33,165 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-18 11:40:33,165 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:33,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-11-18 11:40:33,165 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:40:33,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_731cbf6f-9eba-4490-a3ed-53da19a72752/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-18 11:40:33,169 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 11:40:38,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:40:38,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:40:38,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:40:41,175 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-11-18 11:40:43,334 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-11-18 11:40:45,741 WARN L832 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from false [2018-11-18 11:40:48,140 WARN L854 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from true [2018-11-18 11:40:50,870 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5)))) |c_SqrtR_#res|) is different from false [2018-11-18 11:40:53,572 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5)))) |c_SqrtR_#res|) is different from true [2018-11-18 11:40:53,683 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-18 11:40:53,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:40:54,687 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 11:40:54,888 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-11-18 11:40:54,888 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) 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:151) 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:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java: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) ... 45 more [2018-11-18 11:40:54,890 INFO L168 Benchmark]: Toolchain (without parser) took 220561.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 951.9 MB in the beginning and 946.0 MB in the end (delta: 5.9 MB). Peak memory consumption was 159.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:54,891 INFO L168 Benchmark]: CDTParser took 0.13 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-18 11:40:54,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:54,892 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:40:54,892 INFO L168 Benchmark]: RCFGBuilder took 9017.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:54,893 INFO L168 Benchmark]: TraceAbstraction took 211333.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:54,894 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.13 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 181.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 9017.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 211333.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...