./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.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_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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 8b85ef5e1dcc40735951b08f6181fd3d895983c8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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 8b85ef5e1dcc40735951b08f6181fd3d895983c8 ................................................................................................................................................................................................................................................................................................................................................................................. 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-22 21:47:13,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:47:13,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:47:13,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:47:13,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:47:13,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:47:13,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:47:13,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:47:13,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:47:13,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:47:13,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:47:13,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:47:13,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:47:13,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:47:13,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:47:13,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:47:13,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:47:13,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:47:13,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:47:13,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:47:13,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:47:13,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:47:13,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:47:13,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:47:13,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:47:13,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:47:13,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:47:13,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:47:13,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:47:13,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:47:13,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:47:13,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:47:13,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:47:13,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:47:13,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:47:13,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:47:13,197 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:47:13,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:47:13,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:47:13,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:47:13,205 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:47:13,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:47:13,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:47:13,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:47:13,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:47:13,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:47:13,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:47:13,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:47:13,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:47:13,209 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_e2171df6-6141-4c70-91c7-b6d3c1507698/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 -> 8b85ef5e1dcc40735951b08f6181fd3d895983c8 [2018-11-22 21:47:13,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:47:13,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:47:13,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:47:13,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:47:13,247 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:47:13,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:13,294 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/193615867/bf50fff49dbc4e2aa8796d93221c7930/FLAGc42e1ce76 [2018-11-22 21:47:13,640 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:47:13,640 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:13,645 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/193615867/bf50fff49dbc4e2aa8796d93221c7930/FLAGc42e1ce76 [2018-11-22 21:47:14,055 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/193615867/bf50fff49dbc4e2aa8796d93221c7930 [2018-11-22 21:47:14,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:47:14,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:47:14,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:47:14,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:47:14,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:47:14,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be2b982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14, skipping insertion in model container [2018-11-22 21:47:14,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:47:14,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:47:14,200 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:47:14,202 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:47:14,217 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:47:14,226 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:47:14,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14 WrapperNode [2018-11-22 21:47:14,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:47:14,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:47:14,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:47:14,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:47:14,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:47:14,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:47:14,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:47:14,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:47:14,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... [2018-11-22 21:47:14,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:47:14,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:47:14,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:47:14,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:47:14,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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-22 21:47:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:47:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:47:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:47:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:47:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:47:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:47:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 21:47:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 21:47:14,444 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:47:14,445 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:47:14,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:47:14 BoogieIcfgContainer [2018-11-22 21:47:14,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:47:14,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:47:14,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:47:14,448 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:47:14,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:47:14" (1/3) ... [2018-11-22 21:47:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686ce8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:47:14, skipping insertion in model container [2018-11-22 21:47:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:14" (2/3) ... [2018-11-22 21:47:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686ce8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:47:14, skipping insertion in model container [2018-11-22 21:47:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:47:14" (3/3) ... [2018-11-22 21:47:14,451 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:14,457 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:47:14,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:47:14,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:47:14,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:47:14,492 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:47:14,492 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:47:14,492 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:47:14,492 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:47:14,492 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:47:14,492 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:47:14,492 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:47:14,492 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:47:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-22 21:47:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:47:14,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:47:14,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:47:14,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:47:14,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:47:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1875203651, now seen corresponding path program 1 times [2018-11-22 21:47:14,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:47:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:47:14,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:14,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:47:14,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:47:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:47:14,614 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #33#return; [?] CALL call #t~ret9 := main(); [?] havoc ~E~0;havoc ~E0~0;havoc ~E1~0;havoc ~S0~0;havoc ~S1~0;havoc ~S~0;havoc ~A1~0;havoc ~A2~0;havoc ~A3~0;havoc ~B1~0;havoc ~B2~0;havoc ~i~0;~A1~0 := #t~nondet0;havoc #t~nondet0;~A2~0 := #t~nondet1;havoc #t~nondet1;~A3~0 := #t~nondet2;havoc #t~nondet2;~B1~0 := #t~nondet3;havoc #t~nondet3;~B2~0 := #t~nondet4;havoc #t~nondet4;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0);assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0);assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0);assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0);assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0);~E~0 := #t~nondet5;havoc #t~nondet5;~E0~0 := #t~nondet6;havoc #t~nondet6;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0);assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0);~S0~0 := ~convertINTToDOUBLE(0);~S~0 := ~convertINTToDOUBLE(0);~i~0 := 0; VAL [main_~A1~0=5.0, main_~A2~0=7.0, main_~A3~0=6.0, main_~B1~0=2.0, main_~B2~0=3.0, main_~E0~0=4.0, main_~E~0=9.0, main_~i~0=0] [?] assume !!(~i~0 <= 1000000);~E1~0 := ~E0~0;~E0~0 := ~E~0;~E~0 := #t~nondet8;havoc #t~nondet8;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0);~S1~0 := ~S0~0;~S0~0 := ~S~0;~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [main_~A1~0=5.0, main_~A2~0=7.0, main_~A3~0=6.0, main_~B1~0=2.0, main_~B2~0=3.0, main_~E0~0=9.0, main_~E1~0=4.0, main_~E~0=8.0, main_~i~0=0, main_~S0~0=10.0, main_~S1~0=11.0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] assume !!(~i~0 <= 1000000); [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] assume !!(~i~0 <= 1000000); [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] COND FALSE !(!(~i~0 <= 1000000)) [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] COND FALSE !(!(~i~0 <= 1000000)) [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] COND FALSE !(!(~i~0 <= 1000000)) [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret9 := main(); [L17] havoc ~E~0; [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S0~0; [L17] havoc ~S1~0; [L17] havoc ~S~0; [L18] havoc ~A1~0; [L18] havoc ~A2~0; [L18] havoc ~A3~0; [L18] havoc ~B1~0; [L18] havoc ~B2~0; [L19] havoc ~i~0; [L21] ~A1~0 := #t~nondet0; [L21] havoc #t~nondet0; [L22] ~A2~0 := #t~nondet1; [L22] havoc #t~nondet1; [L23] ~A3~0 := #t~nondet2; [L23] havoc #t~nondet2; [L24] ~B1~0 := #t~nondet3; [L24] havoc #t~nondet3; [L25] ~B2~0 := #t~nondet4; [L25] havoc #t~nondet4; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.69) && ~someBinaryDOUBLEComparisonOperation(~A1~0, 0.71) then 1 else 0); [L27] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(~A2~0, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0); [L28] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.09) && ~someBinaryDOUBLEComparisonOperation(~A3~0, 1.11) then 1 else 0); [L29] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.39) && ~someBinaryDOUBLEComparisonOperation(~B1~0, 1.41) then 1 else 0); [L30] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(~B2~0, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0); [L33] ~E~0 := #t~nondet5; [L33] havoc #t~nondet5; [L34] ~E0~0 := #t~nondet6; [L34] havoc #t~nondet6; [L35] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L36] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L38] ~S0~0 := ~convertINTToDOUBLE(0); [L39] ~S~0 := ~convertINTToDOUBLE(0); [L41] ~i~0 := 0; VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=4.0, ~E~0=9.0, ~i~0=0] [L41-L53] COND FALSE !(!(~i~0 <= 1000000)) [L42] ~E1~0 := ~E0~0; [L43] ~E0~0 := ~E~0; [L45] ~E~0 := #t~nondet8; [L45] havoc #t~nondet8; [L46] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~E~0, 1.0) then 1 else 0); [L48] ~S1~0 := ~S0~0; [L49] ~S0~0 := ~S~0; [L50] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A1~0, ~E~0), ~someBinaryArithmeticDOUBLEoperation(~E0~0, ~A2~0)), ~someBinaryArithmeticDOUBLEoperation(~E1~0, ~A3~0)), ~someBinaryArithmeticDOUBLEoperation(~S0~0, ~B1~0)), ~someBinaryArithmeticDOUBLEoperation(~S1~0, ~B2~0)); VAL [~A1~0=5.0, ~A2~0=7.0, ~A3~0=6.0, ~B1~0=2.0, ~B2~0=3.0, ~E0~0=9.0, ~E1~0=4.0, ~E~0=8.0, ~i~0=0, ~S0~0=10.0, ~S1~0=11.0] [L52] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [L17] double E, E0, E1, S0, S1, S; [L18] double A1, A2, A3, B1, B2; [L19] int i; [L21] A1 = __VERIFIER_nondet_double() [L22] A2 = __VERIFIER_nondet_double() [L23] A3 = __VERIFIER_nondet_double() [L24] B1 = __VERIFIER_nondet_double() [L25] B2 = __VERIFIER_nondet_double() [L33] E = __VERIFIER_nondet_double() [L34] E0 = __VERIFIER_nondet_double() [L38] S0 = 0 [L39] S = 0 [L41] i = 0 VAL [A1=5, A2=7, A3=6, B1=2, B2=3, E=4, E=9, i=0] [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 VAL [A1=5, A2=7, A3=6, B1=2, B2=3, E=4, E=9, E=8, i=0, S0=10, S1=11] [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-22 21:47:14,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:47:14 BoogieIcfgContainer [2018-11-22 21:47:14,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:47:14,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:47:14,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:47:14,642 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:47:14,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:47:14" (3/4) ... [2018-11-22 21:47:14,646 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:47:14,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:47:14,647 INFO L168 Benchmark]: Toolchain (without parser) took 588.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:47:14,648 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:47:14,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:14,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:47:14,649 INFO L168 Benchmark]: Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:47:14,650 INFO L168 Benchmark]: RCFGBuilder took 190.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:14,650 INFO L168 Benchmark]: TraceAbstraction took 196.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:14,651 INFO L168 Benchmark]: Witness Printer took 4.05 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-22 21:47:14,653 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 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 13.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 196.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.05 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: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of to_real at line 38, overapproximation of someBinaryArithmeticDOUBLEoperation at line 50. Possible FailurePath: [L17] double E, E0, E1, S0, S1, S; [L18] double A1, A2, A3, B1, B2; [L19] int i; [L21] A1 = __VERIFIER_nondet_double() [L22] A2 = __VERIFIER_nondet_double() [L23] A3 = __VERIFIER_nondet_double() [L24] B1 = __VERIFIER_nondet_double() [L25] B2 = __VERIFIER_nondet_double() [L33] E = __VERIFIER_nondet_double() [L34] E0 = __VERIFIER_nondet_double() [L38] S0 = 0 [L39] S = 0 [L41] i = 0 VAL [A1=5, A2=7, A3=6, B1=2, B2=3, E=4, E=9, i=0] [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 VAL [A1=5, A2=7, A3=6, B1=2, B2=3, E=4, E=9, E=8, i=0, S0=10, S1=11] [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 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=19occurred 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, 10 NumberOfCodeBlocks, 10 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-22 21:47:16,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:47:16,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:47:16,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:47:16,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:47:16,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:47:16,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:47:16,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:47:16,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:47:16,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:47:16,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:47:16,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:47:16,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:47:16,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:47:16,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:47:16,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:47:16,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:47:16,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:47:16,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:47:16,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:47:16,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:47:16,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:47:16,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:47:16,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:47:16,121 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:47:16,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:47:16,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:47:16,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:47:16,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:47:16,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:47:16,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:47:16,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:47:16,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:47:16,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:47:16,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:47:16,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:47:16,127 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 21:47:16,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:47:16,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:47:16,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:47:16,138 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:47:16,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:47:16,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:47:16,139 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:47:16,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:47:16,140 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:47:16,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:47:16,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:47:16,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:47:16,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:47:16,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:47:16,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:47:16,142 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 21:47:16,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:47:16,143 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:47:16,143 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:47:16,143 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_e2171df6-6141-4c70-91c7-b6d3c1507698/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 -> 8b85ef5e1dcc40735951b08f6181fd3d895983c8 [2018-11-22 21:47:16,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:47:16,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:47:16,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:47:16,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:47:16,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:47:16,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:16,217 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/9d35be69e/5877170fc8dc40819d74c2ef53e445f0/FLAG9d8c94c80 [2018-11-22 21:47:16,617 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:47:16,617 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/sv-benchmarks/c/float-benchs/filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:16,621 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/9d35be69e/5877170fc8dc40819d74c2ef53e445f0/FLAG9d8c94c80 [2018-11-22 21:47:16,630 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/data/9d35be69e/5877170fc8dc40819d74c2ef53e445f0 [2018-11-22 21:47:16,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:47:16,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:47:16,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:47:16,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:47:16,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:47:16,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b44462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16, skipping insertion in model container [2018-11-22 21:47:16,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:47:16,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:47:16,780 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:47:16,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:47:16,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:47:16,809 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:47:16,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16 WrapperNode [2018-11-22 21:47:16,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:47:16,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:47:16,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:47:16,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:47:16,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:47:16,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:47:16,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:47:16,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:47:16,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... [2018-11-22 21:47:16,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:47:16,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:47:16,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:47:16,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:47:16,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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-22 21:47:16,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:47:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:47:16,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:47:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:47:16,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:47:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:47:16,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 21:47:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 21:47:19,230 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:47:19,230 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:47:19,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:47:19 BoogieIcfgContainer [2018-11-22 21:47:19,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:47:19,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:47:19,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:47:19,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:47:19,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:47:16" (1/3) ... [2018-11-22 21:47:19,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee49da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:47:19, skipping insertion in model container [2018-11-22 21:47:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:47:16" (2/3) ... [2018-11-22 21:47:19,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee49da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:47:19, skipping insertion in model container [2018-11-22 21:47:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:47:19" (3/3) ... [2018-11-22 21:47:19,237 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set_true-unreach-call_true-termination.c [2018-11-22 21:47:19,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:47:19,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:47:19,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:47:19,275 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:47:19,275 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:47:19,276 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:47:19,276 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:47:19,276 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:47:19,276 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:47:19,276 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:47:19,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:47:19,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:47:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-22 21:47:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:47:19,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:47:19,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:47:19,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:47:19,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:47:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1875203651, now seen corresponding path program 1 times [2018-11-22 21:47:19,301 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:47:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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-22 21:47:19,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:47:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:47:24,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:47:25,133 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-22 21:47:27,261 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse1)) (fp.leq main_~A1~0 .cse1) (fp.leq main_~B2~0 (fp.neg .cse2)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (= (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B1~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B2~0))) c_main_~S~0) (fp.geq main_~A1~0 .cse2) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53))))) is different from false [2018-11-22 21:47:29,352 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse1)) (fp.leq main_~A1~0 .cse1) (fp.leq main_~B2~0 (fp.neg .cse2)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (= (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B1~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B2~0))) c_main_~S~0) (fp.geq main_~A1~0 .cse2) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53))))) is different from true [2018-11-22 21:47:46,509 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse5 main_~B1~0)) (fp.mul roundNearestTiesToEven .cse5 main_~B2~0)))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse1)) (fp.leq main_~A1~0 .cse1) (fp.leq main_~B2~0 (fp.neg .cse2)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse2) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53)) (fp.leq .cse3 .cse4) (fp.geq .cse3 (fp.neg .cse4)))))) (and .cse6 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.leq v_prenex_12 .cse7) (fp.leq v_prenex_10 .cse8) (fp.geq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_13 (fp.neg .cse9)) (fp.leq v_prenex_14 .cse8) (fp.leq v_prenex_17 .cse8) (not (fp.geq (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_12 v_prenex_17) (fp.mul roundNearestTiesToEven v_prenex_14 v_prenex_15)) (fp.mul roundNearestTiesToEven v_prenex_10 v_prenex_16)) (fp.mul roundNearestTiesToEven .cse10 v_prenex_11)) (fp.mul roundNearestTiesToEven .cse10 v_prenex_13))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_10 (_ +zero 11 53)) (fp.leq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_14 (_ +zero 11 53)) (fp.geq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_12 .cse9) (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_13 (fp.neg .cse7)) (fp.geq v_prenex_17 (_ +zero 11 53)) (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))))))) (and .cse6 (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_1 .cse11) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.geq v_prenex_3 .cse12) (fp.leq v_prenex_3 .cse13) (not (fp.leq (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_3 v_prenex_8) (fp.mul roundNearestTiesToEven v_prenex_5 v_prenex_6)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_4))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.leq v_prenex_4 (fp.neg .cse12)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_5 .cse11) (fp.geq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq v_prenex_8 .cse11) (fp.geq v_prenex_4 (fp.neg .cse13)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53)))))))) is different from false [2018-11-22 21:48:01,567 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_1 .cse1) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.geq v_prenex_3 .cse2) (fp.leq v_prenex_3 .cse3) (not (fp.leq (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_3 v_prenex_8) (fp.mul roundNearestTiesToEven v_prenex_5 v_prenex_6)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse4 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse4 v_prenex_4))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.leq v_prenex_4 (fp.neg .cse2)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq v_prenex_8 .cse1) (fp.geq v_prenex_4 (fp.neg .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53)))))) (and .cse0 (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.leq v_prenex_12 .cse5) (fp.leq v_prenex_10 .cse6) (fp.geq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_13 (fp.neg .cse7)) (fp.leq v_prenex_14 .cse6) (fp.leq v_prenex_17 .cse6) (not (fp.geq (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_12 v_prenex_17) (fp.mul roundNearestTiesToEven v_prenex_14 v_prenex_15)) (fp.mul roundNearestTiesToEven v_prenex_10 v_prenex_16)) (fp.mul roundNearestTiesToEven .cse8 v_prenex_11)) (fp.mul roundNearestTiesToEven .cse8 v_prenex_13))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_10 (_ +zero 11 53)) (fp.leq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_14 (_ +zero 11 53)) (fp.geq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_12 .cse7) (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_13 (fp.neg .cse5)) (fp.geq v_prenex_17 (_ +zero 11 53)) (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))))))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse12 (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse14 main_~B1~0)) (fp.mul roundNearestTiesToEven .cse14 main_~B2~0)))) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse9) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse10)) (fp.leq main_~A1~0 .cse10) (fp.leq main_~B2~0 (fp.neg .cse11)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse9) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse11) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse9) (fp.geq main_~E0~0 (_ +zero 11 53)) (fp.leq .cse12 .cse13) (fp.geq .cse12 (fp.neg .cse13))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-11-22 21:48:12,301 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_1 .cse0) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_3 .cse2) (not (fp.leq (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_3 v_prenex_8) (fp.mul roundNearestTiesToEven v_prenex_5 v_prenex_6)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_4))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.leq v_prenex_4 (fp.neg .cse1)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_5 .cse0) (fp.geq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq v_prenex_8 .cse0) (fp.geq v_prenex_4 (fp.neg .cse2)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53))))) (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.leq v_prenex_12 .cse4) (fp.leq v_prenex_10 .cse5) (fp.geq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_13 (fp.neg .cse6)) (fp.leq v_prenex_14 .cse5) (fp.leq v_prenex_17 .cse5) (not (fp.geq (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_12 v_prenex_17) (fp.mul roundNearestTiesToEven v_prenex_14 v_prenex_15)) (fp.mul roundNearestTiesToEven v_prenex_10 v_prenex_16)) (fp.mul roundNearestTiesToEven .cse7 v_prenex_11)) (fp.mul roundNearestTiesToEven .cse7 v_prenex_13))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_10 (_ +zero 11 53)) (fp.leq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_14 (_ +zero 11 53)) (fp.geq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_12 .cse6) (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_13 (fp.neg .cse4)) (fp.geq v_prenex_17 (_ +zero 11 53)) (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))))))) is different from false [2018-11-22 21:48:14,410 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_1 .cse0) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_3 .cse2) (not (fp.leq (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_3 v_prenex_8) (fp.mul roundNearestTiesToEven v_prenex_5 v_prenex_6)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_4))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.leq v_prenex_4 (fp.neg .cse1)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_5 .cse0) (fp.geq v_prenex_6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq v_prenex_8 .cse0) (fp.geq v_prenex_4 (fp.neg .cse2)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53))))) (exists ((v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.leq v_prenex_12 .cse4) (fp.leq v_prenex_10 .cse5) (fp.geq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_13 (fp.neg .cse6)) (fp.leq v_prenex_14 .cse5) (fp.leq v_prenex_17 .cse5) (not (fp.geq (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_12 v_prenex_17) (fp.mul roundNearestTiesToEven v_prenex_14 v_prenex_15)) (fp.mul roundNearestTiesToEven v_prenex_10 v_prenex_16)) (fp.mul roundNearestTiesToEven .cse7 v_prenex_11)) (fp.mul roundNearestTiesToEven .cse7 v_prenex_13))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_10 (_ +zero 11 53)) (fp.leq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_14 (_ +zero 11 53)) (fp.geq v_prenex_11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_12 .cse6) (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_13 (fp.neg .cse4)) (fp.geq v_prenex_17 (_ +zero 11 53)) (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))))))) is different from true [2018-11-22 21:48:14,416 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-22 21:48:14,417 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:48:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:48:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:48:14,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:48:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:48:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-22 21:48:14,455 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2018-11-22 21:48:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:48:16,820 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-22 21:48:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:48:16,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-11-22 21:48:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:48:16,998 INFO L225 Difference]: With dead ends: 41 [2018-11-22 21:48:16,998 INFO L226 Difference]: Without dead ends: 18 [2018-11-22 21:48:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-22 21:48:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-22 21:48:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 21:48:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 21:48:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-22 21:48:17,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2018-11-22 21:48:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:48:17,027 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-22 21:48:17,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:48:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-22 21:48:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:48:17,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:48:17,029 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:48:17,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:48:17,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:48:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1632080392, now seen corresponding path program 1 times [2018-11-22 21:48:17,030 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:48:17,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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-22 21:48:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:16,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:49:16,831 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-22 21:49:18,976 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq c_main_~E~0 .cse0) (fp.leq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq c_main_~B2~0 (fp.neg .cse1)) (fp.leq c_main_~A1~0 .cse1) (fp.leq c_main_~B2~0 (fp.neg .cse2)) (fp.geq c_main_~E~0 (_ +zero 11 53)) (fp.geq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq c_main_~A1~0 .cse2) (= c_main_~S0~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (exists ((main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq main_~E1~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_main_~S~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 c_main_~E~0) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) c_main_~B2~0))) (fp.geq main_~E1~0 (_ +zero 11 53)))) (fp.geq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq c_main_~E0~0 .cse0) (fp.geq c_main_~E0~0 (_ +zero 11 53)))) is different from false [2018-11-22 21:49:23,322 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq c_main_~E~0 .cse0) (fp.leq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq c_main_~B2~0 (fp.neg .cse1)) (fp.leq c_main_~A1~0 .cse1) (fp.leq c_main_~S~0 .cse2) (fp.leq c_main_~B2~0 (fp.neg .cse3)) (fp.geq c_main_~S~0 (fp.neg .cse2)) (fp.geq c_main_~E~0 (_ +zero 11 53)) (fp.geq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq c_main_~A1~0 .cse3) (= c_main_~S0~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (exists ((main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq main_~E1~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_main_~S~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 c_main_~E~0) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) c_main_~B2~0))) (fp.geq main_~E1~0 (_ +zero 11 53)))) (fp.geq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq c_main_~E0~0 .cse0) (fp.geq c_main_~E0~0 (_ +zero 11 53)))) is different from false [2018-11-22 21:49:25,623 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse6 main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_1 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 main_~B1~0)) .cse5)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse1)) (fp.geq v_subst_1 (_ +zero 11 53)) (fp.leq main_~A1~0 .cse1) (fp.leq main_~B2~0 (fp.neg .cse2)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.leq .cse3 .cse4) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B1~0)) .cse5) c_main_~S~0) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq main_~E1~0 .cse0) (fp.leq v_subst_1 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse2) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53))))))) is different from false [2018-11-22 21:49:27,858 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse6 main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_1 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 main_~B1~0)) .cse5)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse1)) (fp.geq v_subst_1 (_ +zero 11 53)) (fp.leq main_~A1~0 .cse1) (fp.leq main_~B2~0 (fp.neg .cse2)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.leq .cse3 .cse4) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B1~0)) .cse5) c_main_~S~0) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq main_~E1~0 .cse0) (fp.leq v_subst_1 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse2) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53))))))) is different from true [2018-11-22 21:49:46,810 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_27 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 v_prenex_22)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse4 (fp.neg .cse5)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_27 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse7 v_prenex_20)) .cse3)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_23 .cse0) (fp.leq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_22 (fp.neg .cse1)) (fp.geq v_prenex_26 (_ +zero 11 53)) (fp.geq v_prenex_19 (_ +zero 11 53)) (fp.leq v_prenex_27 .cse0) (fp.leq v_prenex_21 .cse1) (fp.geq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_26) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse2 v_prenex_20)) .cse3) .cse4)) (fp.leq v_prenex_26 .cse0) (fp.geq .cse2 .cse4) (fp.geq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_19 .cse0) (fp.leq .cse2 .cse5) (fp.geq v_prenex_27 (_ +zero 11 53)) (fp.leq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_22 (fp.neg .cse6)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_21 .cse6)))))) .cse8) (and (exists ((v_prenex_37 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_34 (_ FloatingPoint 11 53)) (v_prenex_33 (_ FloatingPoint 11 53)) (v_prenex_36 (_ FloatingPoint 11 53)) (v_prenex_35 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse15 v_prenex_32))) (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse10 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_33) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_37 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse15 v_prenex_30)) .cse11)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_33 (_ +zero 11 53)) (fp.leq v_prenex_36 .cse9) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_36) (fp.mul roundNearestTiesToEven v_prenex_33 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse10 v_prenex_30)) .cse11) .cse12)) (fp.leq v_prenex_32 (fp.neg .cse13)) (fp.geq v_prenex_37 (_ +zero 11 53)) (fp.leq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse10 .cse12) (fp.geq v_prenex_36 (_ +zero 11 53)) (fp.leq v_prenex_37 .cse9) (fp.leq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_29 (_ +zero 11 53)) (fp.leq v_prenex_31 .cse14) (fp.leq v_prenex_29 .cse9) (fp.leq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_31 .cse13) (fp.geq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_33 .cse9) (fp.geq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_32 (fp.neg .cse14)) (fp.geq .cse10 (fp.neg .cse12))))))) .cse8) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse24 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse23 (fp.mul roundNearestTiesToEven .cse24 main_~B2~0))) (let ((.cse19 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse21 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_1 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse24 main_~B1~0)) .cse23))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse18 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse21 main_~B1~0)) .cse23)) (.cse22 (fp.neg .cse19)) (.cse16 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse16) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse17)) (fp.geq v_subst_1 (_ +zero 11 53)) (fp.leq main_~A1~0 .cse17) (fp.leq .cse18 .cse19) (fp.leq main_~B2~0 (fp.neg .cse20)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.leq .cse21 .cse19) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq .cse21 .cse22) (fp.leq main_~E1~0 .cse16) (fp.leq v_subst_1 .cse16) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse20) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq .cse18 .cse22) (fp.leq main_~E0~0 .cse16) (fp.geq main_~E0~0 (_ +zero 11 53))))))))))) is different from false [2018-11-22 21:50:03,344 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_27 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse8 v_prenex_22)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse5 (fp.neg .cse6)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_27 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse8 v_prenex_20)) .cse4)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_23 .cse1) (fp.leq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_22 (fp.neg .cse2)) (fp.geq v_prenex_26 (_ +zero 11 53)) (fp.geq v_prenex_19 (_ +zero 11 53)) (fp.leq v_prenex_27 .cse1) (fp.leq v_prenex_21 .cse2) (fp.geq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_26) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_20)) .cse4) .cse5)) (fp.leq v_prenex_26 .cse1) (fp.geq .cse3 .cse5) (fp.geq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_19 .cse1) (fp.leq .cse3 .cse6) (fp.geq v_prenex_27 (_ +zero 11 53)) (fp.leq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_22 (fp.neg .cse7)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_21 .cse7))))))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse16 (fp.mul roundNearestTiesToEven .cse17 main_~B2~0))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse14 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_1 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse17 main_~B1~0)) .cse16))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse11 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse14 main_~B1~0)) .cse16)) (.cse15 (fp.neg .cse12)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse9) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse10)) (fp.geq v_subst_1 (_ +zero 11 53)) (fp.leq main_~A1~0 .cse10) (fp.leq .cse11 .cse12) (fp.leq main_~B2~0 (fp.neg .cse13)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.leq .cse14 .cse12) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq .cse14 .cse15) (fp.leq main_~E1~0 .cse9) (fp.leq v_subst_1 .cse9) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse13) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq .cse11 .cse15) (fp.leq main_~E0~0 .cse9) (fp.geq main_~E0~0 (_ +zero 11 53)))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_37 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_34 (_ FloatingPoint 11 53)) (v_prenex_33 (_ FloatingPoint 11 53)) (v_prenex_36 (_ FloatingPoint 11 53)) (v_prenex_35 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse24 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse20 (fp.mul roundNearestTiesToEven .cse24 v_prenex_32))) (let ((.cse22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse18 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse23 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse19 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_33) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_37 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse24 v_prenex_30)) .cse20)) (.cse21 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_33 (_ +zero 11 53)) (fp.leq v_prenex_36 .cse18) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_36) (fp.mul roundNearestTiesToEven v_prenex_33 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse19 v_prenex_30)) .cse20) .cse21)) (fp.leq v_prenex_32 (fp.neg .cse22)) (fp.geq v_prenex_37 (_ +zero 11 53)) (fp.leq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse19 .cse21) (fp.geq v_prenex_36 (_ +zero 11 53)) (fp.leq v_prenex_37 .cse18) (fp.leq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_29 (_ +zero 11 53)) (fp.leq v_prenex_31 .cse23) (fp.leq v_prenex_29 .cse18) (fp.leq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_31 .cse22) (fp.geq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_33 .cse18) (fp.geq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_32 (fp.neg .cse23)) (fp.geq .cse19 (fp.neg .cse21)))))))))) is different from false [2018-11-22 21:50:15,090 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_37 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_34 (_ FloatingPoint 11 53)) (v_prenex_33 (_ FloatingPoint 11 53)) (v_prenex_36 (_ FloatingPoint 11 53)) (v_prenex_35 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 v_prenex_32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_33) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_37 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse6 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_33 (_ +zero 11 53)) (fp.leq v_prenex_36 .cse0) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_36) (fp.mul roundNearestTiesToEven v_prenex_33 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse1 v_prenex_30)) .cse2) .cse3)) (fp.leq v_prenex_32 (fp.neg .cse4)) (fp.geq v_prenex_37 (_ +zero 11 53)) (fp.leq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse1 .cse3) (fp.geq v_prenex_36 (_ +zero 11 53)) (fp.leq v_prenex_37 .cse0) (fp.leq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_29 (_ +zero 11 53)) (fp.leq v_prenex_31 .cse5) (fp.leq v_prenex_29 .cse0) (fp.leq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_31 .cse4) (fp.geq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_33 .cse0) (fp.geq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_32 (fp.neg .cse5)) (fp.geq .cse1 (fp.neg .cse3))))))) (exists ((v_prenex_27 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse14 v_prenex_22)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse11 (fp.neg .cse12)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_27 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_20)) .cse10)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_23 .cse7) (fp.leq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_22 (fp.neg .cse8)) (fp.geq v_prenex_26 (_ +zero 11 53)) (fp.geq v_prenex_19 (_ +zero 11 53)) (fp.leq v_prenex_27 .cse7) (fp.leq v_prenex_21 .cse8) (fp.geq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_26) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse9 v_prenex_20)) .cse10) .cse11)) (fp.leq v_prenex_26 .cse7) (fp.geq .cse9 .cse11) (fp.geq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_19 .cse7) (fp.leq .cse9 .cse12) (fp.geq v_prenex_27 (_ +zero 11 53)) (fp.leq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_22 (fp.neg .cse13)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_21 .cse13))))))) is different from false [2018-11-22 21:50:17,323 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_37 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_34 (_ FloatingPoint 11 53)) (v_prenex_33 (_ FloatingPoint 11 53)) (v_prenex_36 (_ FloatingPoint 11 53)) (v_prenex_35 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 v_prenex_32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_33) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_37 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse6 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_33 (_ +zero 11 53)) (fp.leq v_prenex_36 .cse0) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_36) (fp.mul roundNearestTiesToEven v_prenex_33 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse1 v_prenex_30)) .cse2) .cse3)) (fp.leq v_prenex_32 (fp.neg .cse4)) (fp.geq v_prenex_37 (_ +zero 11 53)) (fp.leq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse1 .cse3) (fp.geq v_prenex_36 (_ +zero 11 53)) (fp.leq v_prenex_37 .cse0) (fp.leq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_29 (_ +zero 11 53)) (fp.leq v_prenex_31 .cse5) (fp.leq v_prenex_29 .cse0) (fp.leq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_31 .cse4) (fp.geq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_33 .cse0) (fp.geq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_32 (fp.neg .cse5)) (fp.geq .cse1 (fp.neg .cse3))))))) (exists ((v_prenex_27 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse14 v_prenex_22)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse11 (fp.neg .cse12)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_27 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_20)) .cse10)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_23 .cse7) (fp.leq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_22 (fp.neg .cse8)) (fp.geq v_prenex_26 (_ +zero 11 53)) (fp.geq v_prenex_19 (_ +zero 11 53)) (fp.leq v_prenex_27 .cse7) (fp.leq v_prenex_21 .cse8) (fp.geq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_26) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse9 v_prenex_20)) .cse10) .cse11)) (fp.leq v_prenex_26 .cse7) (fp.geq .cse9 .cse11) (fp.geq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_19 .cse7) (fp.leq .cse9 .cse12) (fp.geq v_prenex_27 (_ +zero 11 53)) (fp.leq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_22 (fp.neg .cse13)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_21 .cse13))))))) is different from true [2018-11-22 21:50:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-22 21:50:17,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:50:19,687 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_39 (_ FloatingPoint 11 53))) (or (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 v_prenex_39) (fp.mul roundNearestTiesToEven c_main_~E~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B2~0)) ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq v_prenex_39 (_ +zero 11 53))) (not (fp.leq v_prenex_39 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))) (forall ((v_main_~E~0_8 (_ FloatingPoint 11 53))) (or (not (fp.geq v_main_~E~0_8 (_ +zero 11 53))) (not (fp.leq v_main_~E~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 v_main_~E~0_8) (fp.mul roundNearestTiesToEven c_main_~E~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B2~0)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-22 21:50:21,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.leq c_main_~S~0 .cse2))) (.cse1 (not (fp.geq c_main_~S~0 (fp.neg .cse2))))) (and (or .cse0 (forall ((v_prenex_39 (_ FloatingPoint 11 53))) (or (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 v_prenex_39) (fp.mul roundNearestTiesToEven c_main_~E~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B2~0)) ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq v_prenex_39 (_ +zero 11 53))) (not (fp.leq v_prenex_39 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))) .cse1) (or .cse0 (forall ((v_main_~E~0_8 (_ FloatingPoint 11 53))) (or (not (fp.geq v_main_~E~0_8 (_ +zero 11 53))) (not (fp.leq v_main_~E~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 v_main_~E~0_8) (fp.mul roundNearestTiesToEven c_main_~E~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B2~0)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) .cse1)))) is different from true [2018-11-22 21:50:22,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:50:22,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:50:22,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:50:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-22 21:50:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:50:35,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-22 21:50:35,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 21:50:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:50:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=36, Unknown=10, NotChecked=136, Total=210 [2018-11-22 21:50:35,272 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 11 states. [2018-11-22 21:50:40,696 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_27 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse8 v_prenex_22)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse5 (fp.neg .cse6)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_27 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse8 v_prenex_20)) .cse4)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_23 .cse1) (fp.leq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_22 (fp.neg .cse2)) (fp.geq v_prenex_26 (_ +zero 11 53)) (fp.geq v_prenex_19 (_ +zero 11 53)) (fp.leq v_prenex_27 .cse1) (fp.leq v_prenex_21 .cse2) (fp.geq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_21 v_prenex_26) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_24)) (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_25)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_20)) .cse4) .cse5)) (fp.leq v_prenex_26 .cse1) (fp.geq .cse3 .cse5) (fp.geq v_prenex_25 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_19 .cse1) (fp.leq .cse3 .cse6) (fp.geq v_prenex_27 (_ +zero 11 53)) (fp.leq v_prenex_20 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_22 (fp.neg .cse7)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_24 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_21 .cse7))))))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse16 (fp.mul roundNearestTiesToEven .cse17 main_~B2~0))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse14 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_1 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse17 main_~B1~0)) .cse16))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse11 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse14 main_~B1~0)) .cse16)) (.cse15 (fp.neg .cse12)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse9) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq main_~B2~0 (fp.neg .cse10)) (fp.geq v_subst_1 (_ +zero 11 53)) (fp.leq main_~A1~0 .cse10) (fp.leq .cse11 .cse12) (fp.leq main_~B2~0 (fp.neg .cse13)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.leq .cse14 .cse12) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq .cse14 .cse15) (fp.leq main_~E1~0 .cse9) (fp.leq v_subst_1 .cse9) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse13) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq .cse11 .cse15) (fp.leq main_~E0~0 .cse9) (fp.geq main_~E0~0 (_ +zero 11 53)))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_37 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_34 (_ FloatingPoint 11 53)) (v_prenex_33 (_ FloatingPoint 11 53)) (v_prenex_36 (_ FloatingPoint 11 53)) (v_prenex_35 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse24 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse20 (fp.mul roundNearestTiesToEven .cse24 v_prenex_32))) (let ((.cse22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse18 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse23 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse19 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_33) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_37 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse24 v_prenex_30)) .cse20)) (.cse21 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_33 (_ +zero 11 53)) (fp.leq v_prenex_36 .cse18) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_31 v_prenex_36) (fp.mul roundNearestTiesToEven v_prenex_33 v_prenex_34)) (fp.mul roundNearestTiesToEven v_prenex_29 v_prenex_35)) (fp.mul roundNearestTiesToEven .cse19 v_prenex_30)) .cse20) .cse21)) (fp.leq v_prenex_32 (fp.neg .cse22)) (fp.geq v_prenex_37 (_ +zero 11 53)) (fp.leq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse19 .cse21) (fp.geq v_prenex_36 (_ +zero 11 53)) (fp.leq v_prenex_37 .cse18) (fp.leq v_prenex_30 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_29 (_ +zero 11 53)) (fp.leq v_prenex_31 .cse23) (fp.leq v_prenex_29 .cse18) (fp.leq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_31 .cse22) (fp.geq v_prenex_35 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_33 .cse18) (fp.geq v_prenex_34 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_32 (fp.neg .cse23)) (fp.geq .cse19 (fp.neg .cse21))))))))))) is different from false [2018-11-22 21:50:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:50:40,754 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-22 21:50:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:50:40,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-22 21:50:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:50:40,757 INFO L225 Difference]: With dead ends: 27 [2018-11-22 21:50:40,757 INFO L226 Difference]: Without dead ends: 25 [2018-11-22 21:50:40,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=35, Invalid=46, Unknown=11, NotChecked=180, Total=272 [2018-11-22 21:50:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-22 21:50:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-22 21:50:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 21:50:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-22 21:50:40,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2018-11-22 21:50:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:50:40,770 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-22 21:50:40,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 21:50:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-22 21:50:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:50:40,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:50:40,771 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:50:40,771 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:50:40,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:50:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash 282820957, now seen corresponding path program 2 times [2018-11-22 21:50:40,772 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:50:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2171df6-6141-4c70-91c7-b6d3c1507698/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-22 21:50:40,780 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-22 21:55:11,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:55:11,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:55:12,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:55:12,823 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-22 21:55:13,128 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-22 21:55:13,643 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-22 21:55:15,843 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq c_main_~S0~0 (fp.neg .cse0)) (fp.leq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq c_main_~E~0 .cse1) (fp.leq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq c_main_~B2~0 (fp.neg .cse2)) (fp.leq c_main_~A1~0 .cse2) (fp.leq c_main_~B2~0 (fp.neg .cse3)) (fp.geq c_main_~E~0 (_ +zero 11 53)) (fp.leq c_main_~S0~0 .cse0) (fp.geq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq c_main_~A1~0 .cse3) (exists ((main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq main_~E1~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_main_~S~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 c_main_~E~0) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) c_main_~B2~0))) (fp.geq main_~E1~0 (_ +zero 11 53)))) (fp.geq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq c_main_~E0~0 .cse1) (fp.geq c_main_~E0~0 (_ +zero 11 53)))) is different from false [2018-11-22 21:55:20,258 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse0 (fp.neg .cse3)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq c_main_~S0~0 .cse0) (fp.leq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq c_main_~E~0 .cse1) (fp.leq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq c_main_~B2~0 (fp.neg .cse2)) (fp.leq c_main_~A1~0 .cse2) (fp.leq c_main_~S~0 .cse3) (fp.leq c_main_~B2~0 (fp.neg .cse4)) (fp.geq c_main_~S~0 .cse0) (fp.geq c_main_~E~0 (_ +zero 11 53)) (fp.leq c_main_~S0~0 .cse3) (fp.geq c_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq c_main_~A1~0 .cse4) (exists ((main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq main_~E1~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= c_main_~S~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~A1~0 c_main_~E~0) (fp.mul roundNearestTiesToEven c_main_~E0~0 c_main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 c_main_~A3~0)) (fp.mul roundNearestTiesToEven c_main_~S0~0 c_main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) c_main_~B2~0))) (fp.geq main_~E1~0 (_ +zero 11 53)))) (fp.geq c_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq c_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq c_main_~E0~0 .cse1) (fp.geq c_main_~E0~0 (_ +zero 11 53))))) is different from false [2018-11-22 21:55:22,643 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~S1~0 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_2 main_~A3~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) main_~B2~0))) (.cse5 (fp.neg .cse2))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse1 .cse2) (fp.geq main_~B2~0 (fp.neg .cse3)) (fp.leq main_~A1~0 .cse3) (fp.leq main_~S1~0 .cse2) (fp.leq main_~B2~0 (fp.neg .cse4)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse4) (fp.leq v_subst_2 .cse0) (fp.geq v_subst_2 (_ +zero 11 53)) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse1 main_~B1~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B2~0)) c_main_~S~0) (fp.geq main_~S1~0 .cse5) (fp.geq .cse1 .cse5))))) is different from false [2018-11-22 21:55:24,935 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~S1~0 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_2 main_~A3~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) main_~B2~0))) (.cse5 (fp.neg .cse2))) (and (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse0) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse1 .cse2) (fp.geq main_~B2~0 (fp.neg .cse3)) (fp.leq main_~A1~0 .cse3) (fp.leq main_~S1~0 .cse2) (fp.leq main_~B2~0 (fp.neg .cse4)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse0) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq main_~A1~0 .cse4) (fp.leq v_subst_2 .cse0) (fp.geq v_subst_2 (_ +zero 11 53)) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse0) (fp.geq main_~E0~0 (_ +zero 11 53)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse1 main_~B1~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B2~0)) c_main_~S~0) (fp.geq main_~S1~0 .cse5) (fp.geq .cse1 .cse5))))) is different from true [2018-11-22 21:55:44,499 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~B1~0 (_ FloatingPoint 11 53)) (main_~A1~0 (_ FloatingPoint 11 53)) (main_~B2~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (main_~A2~0 (_ FloatingPoint 11 53)) (main_~A3~0 (_ FloatingPoint 11 53)) (main_~S1~0 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53)) (main_~E~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse3 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E0~0) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A2~0)) (fp.mul roundNearestTiesToEven v_subst_2 main_~A3~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B1~0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) main_~B2~0)))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~A1~0 main_~E~0) (fp.mul roundNearestTiesToEven main_~E0~0 main_~A2~0)) (fp.mul roundNearestTiesToEven main_~E1~0 main_~A3~0)) (fp.mul roundNearestTiesToEven .cse3 main_~B1~0)) (fp.mul roundNearestTiesToEven main_~S1~0 main_~B2~0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.neg .cse4))) (and (fp.geq .cse0 .cse1) (fp.leq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq main_~E~0 .cse2) (fp.leq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq .cse3 .cse4) (fp.geq main_~B2~0 (fp.neg .cse5)) (fp.leq main_~A1~0 .cse5) (fp.leq main_~S1~0 .cse4) (fp.leq main_~B2~0 (fp.neg .cse6)) (fp.geq main_~E~0 (_ +zero 11 53)) (fp.geq main_~E1~0 (_ +zero 11 53)) (fp.geq main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq main_~E1~0 .cse2) (fp.geq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.leq .cse0 .cse4) (fp.geq main_~A1~0 .cse6) (fp.leq v_subst_2 .cse2) (fp.geq v_subst_2 (_ +zero 11 53)) (fp.geq main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E0~0 (_ +zero 11 53)) (fp.geq main_~S1~0 .cse1) (fp.geq .cse3 .cse1)))))) (and (exists ((v_prenex_49 (_ FloatingPoint 11 53)) (v_prenex_48 (_ FloatingPoint 11 53)) (v_prenex_45 (_ FloatingPoint 11 53)) (v_prenex_44 (_ FloatingPoint 11 53)) (v_prenex_47 (_ FloatingPoint 11 53)) (v_prenex_41 (_ FloatingPoint 11 53)) (v_prenex_40 (_ FloatingPoint 11 53)) (v_prenex_43 (_ FloatingPoint 11 53)) (v_prenex_42 (_ FloatingPoint 11 53)) (v_prenex_50 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse10 (fp.neg .cse12)) (.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_42 v_prenex_44) (fp.mul roundNearestTiesToEven v_prenex_40 v_prenex_45)) (fp.mul roundNearestTiesToEven v_prenex_49 v_prenex_47)) (fp.mul roundNearestTiesToEven v_prenex_48 v_prenex_41)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) v_prenex_43))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.leq v_prenex_44 .cse7) (fp.geq v_prenex_50 (_ +zero 11 53)) (fp.leq v_prenex_42 .cse8) (fp.geq v_prenex_44 (_ +zero 11 53)) (fp.geq v_prenex_49 (_ +zero 11 53)) (fp.geq .cse9 .cse10) (fp.geq v_prenex_45 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq v_prenex_50 .cse7) (fp.geq v_prenex_48 .cse10) (fp.leq v_prenex_45 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_47 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq v_prenex_43 (fp.neg .cse11)) (fp.leq v_prenex_49 .cse7) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_42 v_prenex_50) (fp.mul roundNearestTiesToEven v_prenex_44 v_prenex_45)) (fp.mul roundNearestTiesToEven v_prenex_40 v_prenex_47)) (fp.mul roundNearestTiesToEven .cse9 v_prenex_41)) (fp.mul roundNearestTiesToEven v_prenex_48 v_prenex_43)) .cse12)) (fp.leq .cse9 .cse12) (fp.geq v_prenex_47 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.geq v_prenex_43 (fp.neg .cse8)) (fp.leq v_prenex_40 .cse7) (fp.geq v_prenex_41 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.leq v_prenex_41 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_42 .cse11) (fp.leq v_prenex_48 .cse12) (fp.geq v_prenex_40 (_ +zero 11 53)))))) .cse13) (and (exists ((v_prenex_59 (_ FloatingPoint 11 53)) (v_prenex_56 (_ FloatingPoint 11 53)) (v_prenex_55 (_ FloatingPoint 11 53)) (v_prenex_58 (_ FloatingPoint 11 53)) (v_prenex_52 (_ FloatingPoint 11 53)) (v_prenex_51 (_ FloatingPoint 11 53)) (v_prenex_54 (_ FloatingPoint 11 53)) (v_prenex_53 (_ FloatingPoint 11 53)) (v_prenex_61 (_ FloatingPoint 11 53)) (v_prenex_60 (_ FloatingPoint 11 53))) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (let ((.cse16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse17 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_53 v_prenex_55) (fp.mul roundNearestTiesToEven v_prenex_51 v_prenex_56)) (fp.mul roundNearestTiesToEven v_prenex_60 v_prenex_58)) (fp.mul roundNearestTiesToEven v_prenex_59 v_prenex_52)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) v_prenex_54))) (.cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse19 (fp.neg .cse15))) (and (fp.leq v_prenex_61 .cse14) (fp.leq v_prenex_59 .cse15) (fp.geq v_prenex_53 .cse16) (fp.leq v_prenex_55 .cse14) (fp.leq v_prenex_58 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_52 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.leq .cse17 .cse15) (fp.leq v_prenex_60 .cse14) (fp.geq v_prenex_58 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.geq v_prenex_56 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_54 (fp.neg .cse18)) (fp.geq v_prenex_61 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_53 v_prenex_61) (fp.mul roundNearestTiesToEven v_prenex_55 v_prenex_56)) (fp.mul roundNearestTiesToEven v_prenex_51 v_prenex_58)) (fp.mul roundNearestTiesToEven .cse17 v_prenex_52)) (fp.mul roundNearestTiesToEven v_prenex_59 v_prenex_54)) .cse19)) (fp.geq v_prenex_51 (_ +zero 11 53)) (fp.leq v_prenex_52 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq v_prenex_54 (fp.neg .cse16)) (fp.leq v_prenex_51 .cse14) (fp.geq v_prenex_60 (_ +zero 11 53)) (fp.geq .cse17 .cse19) (fp.geq v_prenex_55 (_ +zero 11 53)) (fp.leq v_prenex_56 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq v_prenex_53 .cse18) (fp.geq v_prenex_59 .cse19))))) .cse13))) is different from false [2018-11-22 21:56:01,004 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-22 21:56:01,205 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2018-11-22 21:56:01,205 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:823) 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-22 21:56:01,208 INFO L168 Benchmark]: Toolchain (without parser) took 524575.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 949.7 MB in the beginning and 883.0 MB in the end (delta: 66.7 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:01,208 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:01,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.37 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:01,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:01,210 INFO L168 Benchmark]: Boogie Preprocessor took 20.53 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:56:01,210 INFO L168 Benchmark]: RCFGBuilder took 2383.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:01,210 INFO L168 Benchmark]: TraceAbstraction took 521975.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.0 MB in the end (delta: 226.8 MB). Peak memory consumption was 226.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:56:01,213 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.37 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 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 16.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.53 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2383.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 521975.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.0 MB in the end (delta: 226.8 MB). Peak memory consumption was 226.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...