./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-aa41828 [2018-11-23 02:52:58,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:52:58,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:52:58,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:52:58,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:52:58,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:52:58,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:52:58,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:52:58,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:52:58,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:52:58,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:52:58,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:52:58,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:52:58,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:52:58,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:52:58,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:52:58,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:52:58,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:52:58,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:52:58,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:52:58,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:52:58,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:52:58,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:52:58,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:52:58,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:52:58,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:52:58,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:52:58,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:52:58,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:52:58,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:52:58,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:52:58,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:52:58,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:52:58,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:52:58,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:52:58,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:52:58,858 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:52:58,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:52:58,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:52:58,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:52:58,870 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:52:58,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:52:58,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:52:58,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:52:58,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:52:58,871 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:52:58,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:52:58,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:52:58,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:52:58,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:52:58,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:52:58,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:52:58,873 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:52:58,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:52:58,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:52:58,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:52:58,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:52:58,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:52:58,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:52:58,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:52:58,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:52:58,874 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_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:52:58,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:52:58,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:52:58,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:52:58,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:52:58,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:52:58,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:52:58,952 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/5f8020d14/0ba6f0172e134ae0bc405fb504b7fac5/FLAG3021d0378 [2018-11-23 02:52:59,303 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:52:59,303 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:52:59,307 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/5f8020d14/0ba6f0172e134ae0bc405fb504b7fac5/FLAG3021d0378 [2018-11-23 02:52:59,718 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/5f8020d14/0ba6f0172e134ae0bc405fb504b7fac5 [2018-11-23 02:52:59,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:52:59,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:52:59,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:52:59,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:52:59,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:52:59,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3605d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59, skipping insertion in model container [2018-11-23 02:52:59,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:52:59,751 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:52:59,877 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:52:59,882 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:52:59,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:52:59,903 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:52:59,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59 WrapperNode [2018-11-23 02:52:59,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:52:59,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:52:59,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:52:59,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:52:59,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:52:59,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:52:59,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:52:59,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:52:59,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... [2018-11-23 02:52:59,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:52:59,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:52:59,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:52:59,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:52:59,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:53:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:53:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-23 02:53:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-23 02:53:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:53:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:53:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:53:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:53:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:53:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:53:00,132 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:53:00,132 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:53:00,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:00 BoogieIcfgContainer [2018-11-23 02:53:00,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:53:00,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:53:00,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:53:00,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:53:00,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:52:59" (1/3) ... [2018-11-23 02:53:00,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fddb915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:00, skipping insertion in model container [2018-11-23 02:53:00,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:52:59" (2/3) ... [2018-11-23 02:53:00,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fddb915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:00, skipping insertion in model container [2018-11-23 02:53:00,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:00" (3/3) ... [2018-11-23 02:53:00,139 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:53:00,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:53:00,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:53:00,159 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:53:00,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:53:00,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:53:00,179 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:53:00,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:53:00,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:53:00,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:53:00,180 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:53:00,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:53:00,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:53:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 02:53:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:53:00,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:53:00,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:53:00,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:53:00,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:53:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-23 02:53:00,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:53:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:53:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:53:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:53:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:53:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:53:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:53:00,283 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=2.0] [?] ~_EPS~0 := 1.0E-6; VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #58#return; VAL [~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~d~0;havoc ~r~0;~d~0 := 1.0; VAL [main_~d~0=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0); VAL [main_~d~0=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret2 := SqrtR(~d~0); VAL [|SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~Input := #in~Input;havoc ~xn~0;havoc ~xnp1~0;havoc ~residu~0;havoc ~lsup~0;havoc ~linf~0;havoc ~i~0;havoc ~cond~0; VAL [SqrtR_~Input=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0);~xn~0 := 1.0; VAL [SqrtR_~Input=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~xnp1~0 := ~xn~0;~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0));~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0));~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0);~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0);~i~0 := 0; VAL [SqrtR_~cond~0=0, SqrtR_~Input=1.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !(0 != ~cond~0); VAL [SqrtR_~cond~0=0, SqrtR_~Input=1.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [SqrtR_~cond~0=0, SqrtR_~Input=1.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [SqrtR_~cond~0=0, SqrtR_~Input=1.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=1.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #62#return; VAL [main_~d~0=1.0, |main_#t~ret2|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~r~0 := #t~ret2;havoc #t~ret2; VAL [main_~d~0=1.0, main_~r~0=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0); VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0); [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] assume !(0 != ~cond~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L19-L40] ensures true; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assume 0 == ~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0); VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0); [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] assume !(0 != ~cond~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L19-L40] ensures true; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assume 0 == ~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] COND TRUE !(0 != ~cond~0) VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] COND TRUE !(0 != ~cond~0) VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] COND TRUE !(0 != ~cond~0) VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L17] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret3 := main(); VAL [~_EPS~0=1/1000000] [L44] havoc ~d~0; [L44] havoc ~r~0; [L46] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L46-L51] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) VAL [~_EPS~0=1/1000000, ~d~0=1.0] [L48] CALL call #t~ret2 := SqrtR(~d~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000] [L19-L40] ~Input := #in~Input; [L21] havoc ~xn~0; [L21] havoc ~xnp1~0; [L21] havoc ~residu~0; [L21] havoc ~lsup~0; [L21] havoc ~linf~0; [L22] havoc ~i~0; [L22] havoc ~cond~0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0] [L23] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L23] ~xn~0 := 1.0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~Input=1.0, ~xn~0=1.0] [L24] ~xnp1~0 := ~xn~0; [L25] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L26] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L27] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L28] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L29] ~i~0 := 0; VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L30-L38] COND TRUE !(0 != ~cond~0) VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L39] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=1.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=1.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L48] RET call #t~ret2 := SqrtR(~d~0); VAL [#t~ret2=3.0, ~_EPS~0=1/1000000, ~d~0=1.0] [L48] ~r~0 := #t~ret2; [L48] havoc #t~ret2; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~r~0=3.0] [L50] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L15] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L15] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [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] return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] RET, 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] ----- [2018-11-23 02:53:00,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:53:00 BoogieIcfgContainer [2018-11-23 02:53:00,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:53:00,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:53:00,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:53:00,316 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:53:00,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:00" (3/4) ... [2018-11-23 02:53:00,320 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:53:00,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:53:00,321 INFO L168 Benchmark]: Toolchain (without parser) took 599.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:53:00,322 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:53:00,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:53:00,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:53:00,323 INFO L168 Benchmark]: Boogie Preprocessor took 18.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:53:00,324 INFO L168 Benchmark]: RCFGBuilder took 195.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:53:00,324 INFO L168 Benchmark]: TraceAbstraction took 182.63 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:53:00,325 INFO L168 Benchmark]: Witness Printer took 4.01 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-23 02:53:00,327 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 182.63 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 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] return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] RET, 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, 29 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:53:01,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:53:01,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:53:01,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:53:01,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:53:01,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:53:01,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:53:01,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:53:01,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:53:01,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:53:01,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:53:01,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:53:01,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:53:01,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:53:01,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:53:01,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:53:01,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:53:01,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:53:01,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:53:01,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:53:01,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:53:01,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:53:01,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:53:01,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:53:01,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:53:01,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:53:01,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:53:01,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:53:01,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:53:01,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:53:01,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:53:01,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:53:01,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:53:01,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:53:01,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:53:01,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:53:01,856 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 02:53:01,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:53:01,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:53:01,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:53:01,867 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:53:01,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:53:01,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:53:01,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:53:01,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:53:01,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:53:01,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:53:01,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:53:01,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:53:01,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:53:01,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:53:01,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:53:01,871 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:53:01,871 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_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:01,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:53:01,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:53:01,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:53:01,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:53:01,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:53:01,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:53:01,958 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/aaf7f6dcc/62d62dc2c71245bda894786aebb4c8c5/FLAG0cf4d45f3 [2018-11-23 02:53:02,269 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:53:02,269 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:53:02,273 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/aaf7f6dcc/62d62dc2c71245bda894786aebb4c8c5/FLAG0cf4d45f3 [2018-11-23 02:53:02,281 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/bin-2019/uautomizer/data/aaf7f6dcc/62d62dc2c71245bda894786aebb4c8c5 [2018-11-23 02:53:02,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:53:02,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:53:02,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:53:02,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:53:02,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:53:02,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36936f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02, skipping insertion in model container [2018-11-23 02:53:02,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:53:02,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:53:02,428 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:53:02,433 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:53:02,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:53:02,459 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:53:02,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02 WrapperNode [2018-11-23 02:53:02,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:53:02,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:53:02,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:53:02,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:53:02,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:53:02,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:53:02,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:53:02,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:53:02,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... [2018-11-23 02:53:02,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:53:02,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:53:02,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:53:02,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:53:02,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:53:02,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:53:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-23 02:53:02,587 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-23 02:53:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:53:02,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:53:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:53:02,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:53:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:53:02,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:53:11,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:53:11,171 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:53:11,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:11 BoogieIcfgContainer [2018-11-23 02:53:11,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:53:11,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:53:11,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:53:11,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:53:11,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:53:02" (1/3) ... [2018-11-23 02:53:11,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee2106b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:11, skipping insertion in model container [2018-11-23 02:53:11,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:02" (2/3) ... [2018-11-23 02:53:11,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee2106b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:11, skipping insertion in model container [2018-11-23 02:53:11,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:11" (3/3) ... [2018-11-23 02:53:11,177 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-23 02:53:11,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:53:11,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:53:11,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:53:11,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:53:11,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:53:11,226 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:53:11,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:53:11,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:53:11,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:53:11,227 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:53:11,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:53:11,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:53:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 02:53:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:53:11,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:53:11,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:53:11,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:53:11,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:53:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-23 02:53:11,257 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:53:11,257 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:11,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:53:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:12,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:53:20,884 WARN L180 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-23 02:53:20,889 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-23 02:53:20,889 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:53:20,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:53:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:53:20,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:53:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:53:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:53:20,928 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-11-23 02:53:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:53:27,334 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-23 02:53:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:53:27,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 02:53:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:53:27,341 INFO L225 Difference]: With dead ends: 54 [2018-11-23 02:53:27,341 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 02:53:27,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:53:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 02:53:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 02:53:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 02:53:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 02:53:27,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-23 02:53:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:53:27,371 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 02:53:27,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:53:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 02:53:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:53:27,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:53:27,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:53:27,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:53:27,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:53:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2018-11-23 02:53:27,373 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:53:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:27,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:53:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:29,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:53:29,386 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-23 02:53:29,386 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:53:29,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:53:29,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:53:29,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:53:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:53:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:53:29,421 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-23 02:53:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:53:33,573 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 02:53:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:53:33,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 02:53:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:53:33,577 INFO L225 Difference]: With dead ends: 55 [2018-11-23 02:53:33,577 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:53:33,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:53:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:53:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 02:53:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 02:53:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 02:53:33,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-11-23 02:53:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:53:33,587 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 02:53:33,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:53:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 02:53:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:53:33,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:53:33,588 INFO L402 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-23 02:53:33,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:53:33,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:53:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash -224200478, now seen corresponding path program 1 times [2018-11-23 02:53:33,589 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:53:33,589 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:53:33,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:53:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:37,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:53:39,611 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-23 02:53:41,741 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-23 02:53:44,165 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-23 02:53:46,612 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-23 02:53:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 02:53:46,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:54:09,356 WARN L180 SmtUtils]: Spent 22.49 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 02:54:26,338 WARN L180 SmtUtils]: Spent 16.98 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 02:54:52,526 WARN L180 SmtUtils]: Spent 26.19 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 02:55:18,603 WARN L180 SmtUtils]: Spent 26.08 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 02:55:21,047 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-23 02:55:23,495 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-23 02:55:25,964 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-23 02:55:28,422 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-23 02:55:31,197 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-23 02:55:33,929 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-23 02:55:36,888 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-23 02:55:39,821 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-23 02:55:42,691 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-23 02:55:45,564 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-23 02:55:48,007 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-23 02:55:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 02:55:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:55:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 02:55:48,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 02:55:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:55:48,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-23 02:55:48,079 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 20 states. [2018-11-23 02:55:50,552 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-23 02:55:53,003 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-23 02:55:55,483 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-23 02:55:58,368 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-23 02:56:00,820 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-23 02:56:03,811 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-23 02:56:06,312 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-23 02:56:09,153 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-23 02:56:16,522 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-23 02:56:18,971 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-23 02:56:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:19,268 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 02:56:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:56:19,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-11-23 02:56:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:19,270 INFO L225 Difference]: With dead ends: 48 [2018-11-23 02:56:19,270 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 02:56:19,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=58, Invalid=148, Unknown=24, NotChecked=420, Total=650 [2018-11-23 02:56:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 02:56:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 02:56:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 02:56:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 02:56:19,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2018-11-23 02:56:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:19,278 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 02:56:19,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 02:56:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 02:56:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:56:19,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:19,279 INFO L402 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-23 02:56:19,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:19,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash 33964960, now seen corresponding path program 1 times [2018-11-23 02:56:19,280 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:56:19,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:56:19,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:23,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:56:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:56:23,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:56:23,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:23,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:56:23,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:56:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:56:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:56:23,859 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-23 02:56:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:29,907 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 02:56:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:56:29,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 02:56:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:29,910 INFO L225 Difference]: With dead ends: 77 [2018-11-23 02:56:29,910 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 02:56:29,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:56:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 02:56:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-11-23 02:56:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 02:56:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 02:56:29,922 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2018-11-23 02:56:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:29,922 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 02:56:29,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:56:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 02:56:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:56:29,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:29,924 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:29,924 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:29,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2096977090, now seen corresponding path program 2 times [2018-11-23 02:56:29,924 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:56:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43294e0d-588c-4b3d-91ea-86ef9b7e8765/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-23 02:56:29,928 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:56:35,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:56:35,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:56:35,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:56:38,021 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-23 02:56:40,219 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-23 02:56:42,617 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-23 02:56:45,008 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-23 02:56:47,842 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-23 02:56:48,977 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 02:56:49,178 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-11-23 02:56:49,178 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-23 02:56:49,181 INFO L168 Benchmark]: Toolchain (without parser) took 226897.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.8 MB in the beginning and 948.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:49,182 INFO L168 Benchmark]: CDTParser took 0.16 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-23 02:56:49,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:49,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.71 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:56:49,183 INFO L168 Benchmark]: Boogie Preprocessor took 18.62 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:56:49,183 INFO L168 Benchmark]: RCFGBuilder took 8678.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:49,184 INFO L168 Benchmark]: TraceAbstraction took 218008.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 153.2 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:49,186 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.71 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.62 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8678.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 218008.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 153.2 MB). Peak memory consumption was 153.2 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...