./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 affc33a17eeaac5bbef8bea17cfba29382789d60 .......................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 affc33a17eeaac5bbef8bea17cfba29382789d60 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:04:07,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:04:07,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:04:07,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:04:07,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:04:07,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:04:07,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:04:07,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:04:07,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:04:07,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:04:07,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:04:07,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:04:07,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:04:07,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:04:07,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:04:07,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:04:07,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:04:07,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:04:07,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:04:07,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:04:07,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:04:07,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:04:07,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:04:07,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:04:07,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:04:07,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:04:07,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:04:07,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:04:07,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:04:07,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:04:07,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:04:07,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:04:07,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:04:07,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:04:07,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:04:07,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:04:07,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:04:07,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:04:07,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:04:07,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:04:07,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:04:07,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:04:07,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:04:07,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:04:07,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:04:07,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:04:07,612 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:04:07,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:04:07,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:04:07,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:04:07,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:04:07,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:04:07,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:04:07,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:04:07,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:04:07,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:04:07,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:04:07,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:04:07,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:04:07,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:04:07,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:04:07,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:04:07,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:04:07,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:04:07,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:04:07,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:04:07,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:04:07,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:04:07,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:04:07,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:04:07,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 -> affc33a17eeaac5bbef8bea17cfba29382789d60 [2019-11-20 08:04:07,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:04:07,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:04:07,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:04:07,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:04:07,782 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:04:07,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2019-11-20 08:04:07,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/7b8700c85/1d9929973a1c42f7910c77a1d0973e62/FLAGd8bca19be [2019-11-20 08:04:08,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:04:08,244 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2019-11-20 08:04:08,253 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/7b8700c85/1d9929973a1c42f7910c77a1d0973e62/FLAGd8bca19be [2019-11-20 08:04:08,556 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/7b8700c85/1d9929973a1c42f7910c77a1d0973e62 [2019-11-20 08:04:08,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:04:08,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:04:08,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:04:08,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:04:08,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:04:08,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:08" (1/1) ... [2019-11-20 08:04:08,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407055d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:08, skipping insertion in model container [2019-11-20 08:04:08,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:08" (1/1) ... [2019-11-20 08:04:08,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:04:08,620 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:04:08,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:04:08,952 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:04:09,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:04:09,024 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:04:09,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09 WrapperNode [2019-11-20 08:04:09,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:04:09,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:04:09,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:04:09,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:04:09,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:04:09,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:04:09,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:04:09,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:04:09,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... [2019-11-20 08:04:09,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:04:09,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:04:09,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:04:09,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:04:09,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 [2019-11-20 08:04:09,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 08:04:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 08:04:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 08:04:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 08:04:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:04:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:04:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 08:04:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 08:04:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:04:09,940 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:04:09,940 INFO L285 CfgBuilder]: Removed 48 assume(true) statements. [2019-11-20 08:04:09,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:09 BoogieIcfgContainer [2019-11-20 08:04:09,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:04:09,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:04:09,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:04:09,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:04:09,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:04:08" (1/3) ... [2019-11-20 08:04:09,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5edfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:09, skipping insertion in model container [2019-11-20 08:04:09,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:09" (2/3) ... [2019-11-20 08:04:09,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5edfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:09, skipping insertion in model container [2019-11-20 08:04:09,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:09" (3/3) ... [2019-11-20 08:04:09,948 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a.c [2019-11-20 08:04:09,956 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:04:09,963 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:04:09,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:04:09,994 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:04:09,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:04:09,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:04:09,995 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:04:09,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:04:09,995 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:04:09,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:04:09,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:04:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-20 08:04:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 08:04:10,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:10,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:10,019 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:10,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2019-11-20 08:04:10,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:10,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42418292] [2019-11-20 08:04:10,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42418292] [2019-11-20 08:04:10,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:04:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495959738] [2019-11-20 08:04:10,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 08:04:10,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 08:04:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:04:10,243 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2019-11-20 08:04:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:10,269 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2019-11-20 08:04:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 08:04:10,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-20 08:04:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:10,279 INFO L225 Difference]: With dead ends: 237 [2019-11-20 08:04:10,280 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 08:04:10,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:04:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 08:04:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-20 08:04:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 08:04:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2019-11-20 08:04:10,323 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2019-11-20 08:04:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:10,324 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2019-11-20 08:04:10,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 08:04:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2019-11-20 08:04:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:04:10,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:10,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:10,325 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2019-11-20 08:04:10,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:10,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729740180] [2019-11-20 08:04:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:04:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:04:10,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:04:10,478 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 08:04:10,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:04:10 BoogieIcfgContainer [2019-11-20 08:04:10,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:04:10,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:04:10,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:04:10,535 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:04:10,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:09" (3/4) ... [2019-11-20 08:04:10,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 08:04:10,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:04:10,540 INFO L168 Benchmark]: Toolchain (without parser) took 1979.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -78.5 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:04:10,541 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:04:10,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:04:10,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:04:10,543 INFO L168 Benchmark]: Boogie Preprocessor took 56.72 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. [2019-11-20 08:04:10,543 INFO L168 Benchmark]: RCFGBuilder took 784.24 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:04:10,544 INFO L168 Benchmark]: TraceAbstraction took 592.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:04:10,544 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:04:10,548 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.72 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. * RCFGBuilder took 784.24 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 592.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 271]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 265, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 270. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L264] double x = __VERIFIER_nondet_double(); [L265] double y = -0.0; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L267] COND TRUE x > 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L268] double res = __ieee754_atan2(y, x); [L270] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L270] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L271] __VERIFIER_error() VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 08:04:12,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:04:12,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:04:12,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:04:12,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:04:12,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:04:12,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:04:12,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:04:12,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:04:12,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:04:12,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:04:12,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:04:12,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:04:12,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:04:12,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:04:12,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:04:12,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:04:12,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:04:12,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:04:12,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:04:12,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:04:12,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:04:12,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:04:12,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:04:12,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:04:12,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:04:12,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:04:12,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:04:12,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:04:12,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:04:12,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:04:12,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:04:12,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:04:12,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:04:12,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:04:12,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:04:12,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:04:12,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:04:12,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:04:12,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:04:12,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:04:12,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 08:04:12,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:04:12,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:04:12,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:04:12,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:04:12,679 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:04:12,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:04:12,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:04:12,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:04:12,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:04:12,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:04:12,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:04:12,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:04:12,682 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 08:04:12,682 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 08:04:12,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:04:12,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:04:12,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:04:12,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:04:12,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:04:12,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:04:12,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:04:12,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:04:12,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:04:12,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:04:12,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:04:12,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:04:12,688 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 08:04:12,689 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 08:04:12,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:04:12,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 08:04:12,690 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 -> affc33a17eeaac5bbef8bea17cfba29382789d60 [2019-11-20 08:04:12,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:04:12,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:04:12,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:04:12,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:04:12,963 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:04:12,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2019-11-20 08:04:13,014 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/1af5a5ef5/0ac6c8282d9d459f8be9b87a1c286b24/FLAG6fd037323 [2019-11-20 08:04:13,391 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:04:13,393 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2019-11-20 08:04:13,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/1af5a5ef5/0ac6c8282d9d459f8be9b87a1c286b24/FLAG6fd037323 [2019-11-20 08:04:13,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/data/1af5a5ef5/0ac6c8282d9d459f8be9b87a1c286b24 [2019-11-20 08:04:13,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:04:13,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:04:13,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:04:13,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:04:13,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:04:13,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:13" (1/1) ... [2019-11-20 08:04:13,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19339ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:13, skipping insertion in model container [2019-11-20 08:04:13,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:13" (1/1) ... [2019-11-20 08:04:13,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:04:13,800 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:04:14,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:04:14,105 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:04:14,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:04:14,247 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:04:14,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14 WrapperNode [2019-11-20 08:04:14,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:04:14,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:04:14,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:04:14,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:04:14,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:04:14,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:04:14,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:04:14,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:04:14,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... [2019-11-20 08:04:14,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:04:14,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:04:14,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:04:14,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:04:14,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 [2019-11-20 08:04:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 08:04:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 08:04:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 08:04:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 08:04:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 08:04:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:04:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:04:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 08:04:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:04:52,686 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:04:52,686 INFO L285 CfgBuilder]: Removed 48 assume(true) statements. [2019-11-20 08:04:52,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:52 BoogieIcfgContainer [2019-11-20 08:04:52,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:04:52,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:04:52,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:04:52,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:04:52,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:04:13" (1/3) ... [2019-11-20 08:04:52,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dd571f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:52, skipping insertion in model container [2019-11-20 08:04:52,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:14" (2/3) ... [2019-11-20 08:04:52,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dd571f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:52, skipping insertion in model container [2019-11-20 08:04:52,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:52" (3/3) ... [2019-11-20 08:04:52,696 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a.c [2019-11-20 08:04:52,705 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:04:52,711 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:04:52,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:04:52,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:04:52,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:04:52,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:04:52,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:04:52,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:04:52,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:04:52,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:04:52,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:04:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-20 08:04:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 08:04:52,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:52,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:52,764 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2019-11-20 08:04:52,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:04:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882748263] [2019-11-20 08:04:52,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 [2019-11-20 08:04:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:53,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 08:04:53,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:53,097 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:04:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:53,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882748263] [2019-11-20 08:04:53,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:53,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 08:04:53,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465000280] [2019-11-20 08:04:53,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 08:04:53,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:04:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 08:04:53,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:04:53,124 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2019-11-20 08:04:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:53,154 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2019-11-20 08:04:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 08:04:53,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-20 08:04:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:53,167 INFO L225 Difference]: With dead ends: 237 [2019-11-20 08:04:53,167 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 08:04:53,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:04:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 08:04:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-20 08:04:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 08:04:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2019-11-20 08:04:53,215 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2019-11-20 08:04:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:53,215 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2019-11-20 08:04:53,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 08:04:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2019-11-20 08:04:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:04:53,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:53,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:53,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 08:04:53,438 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2019-11-20 08:04:53,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:04:53,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15312039] [2019-11-20 08:04:53,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 [2019-11-20 08:04:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:53,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 08:04:53,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:54,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 08:04:54,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 08:04:54,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:54,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 08:04:54,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:54,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 08:04:54,146 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:54,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,163 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:04:54,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:04:54,194 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:31 [2019-11-20 08:04:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:54,432 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:04:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:54,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:54,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:54,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 88 [2019-11-20 08:04:54,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 08:04:54,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 08:04:55,059 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,089 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 89 [2019-11-20 08:04:55,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 76 [2019-11-20 08:04:55,201 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2019-11-20 08:04:55,262 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 08:04:55,324 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,342 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:04:55,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:04:55,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-20 08:04:55,402 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:173, output treesize:81 [2019-11-20 08:04:55,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:55,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15312039] [2019-11-20 08:04:55,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 08:04:55,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789019040] [2019-11-20 08:04:55,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:04:55,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:04:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:04:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:04:55,619 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand 14 states. [2019-11-20 08:04:56,179 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 08:04:56,425 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 08:04:56,611 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:04:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:58,391 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2019-11-20 08:04:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:04:58,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-11-20 08:04:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:58,781 INFO L225 Difference]: With dead ends: 171 [2019-11-20 08:04:58,781 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 08:04:58,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:04:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 08:04:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 08:04:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 08:04:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2019-11-20 08:04:58,796 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 14 [2019-11-20 08:04:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:58,797 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2019-11-20 08:04:58,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:04:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2019-11-20 08:04:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:04:58,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:58,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:59,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 08:04:59,012 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1963663166, now seen corresponding path program 1 times [2019-11-20 08:04:59,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:04:59,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397429373] [2019-11-20 08:04:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 08:04:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:59,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:04:59,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:59,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:04:59,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:59,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397429373] [2019-11-20 08:04:59,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:59,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-20 08:04:59,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188030766] [2019-11-20 08:04:59,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:04:59,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:04:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:04:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:04:59,525 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand 11 states. [2019-11-20 08:05:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:01,754 INFO L93 Difference]: Finished difference Result 184 states and 246 transitions. [2019-11-20 08:05:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:05:01,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-20 08:05:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:01,762 INFO L225 Difference]: With dead ends: 184 [2019-11-20 08:05:01,762 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 08:05:01,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 08:05:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 08:05:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2019-11-20 08:05:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 08:05:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2019-11-20 08:05:01,775 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 19 [2019-11-20 08:05:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:01,775 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2019-11-20 08:05:01,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:05:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2019-11-20 08:05:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:05:01,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:01,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:01,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 08:05:01,997 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash -188655804, now seen corresponding path program 1 times [2019-11-20 08:05:01,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:01,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420797720] [2019-11-20 08:05:01,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/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 [2019-11-20 08:05:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:02,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:05:02,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:02,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:02,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:02,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420797720] [2019-11-20 08:05:02,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:02,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 08:05:02,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107726724] [2019-11-20 08:05:02,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 08:05:02,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 08:05:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:05:02,396 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand 9 states. [2019-11-20 08:05:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:07,171 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2019-11-20 08:05:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:05:07,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-20 08:05:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:07,173 INFO L225 Difference]: With dead ends: 119 [2019-11-20 08:05:07,173 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 08:05:07,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:05:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 08:05:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 08:05:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 08:05:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2019-11-20 08:05:07,186 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 19 [2019-11-20 08:05:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-20 08:05:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 08:05:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2019-11-20 08:05:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:05:07,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:07,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:07,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 08:05:07,404 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 291898349, now seen corresponding path program 1 times [2019-11-20 08:05:07,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:07,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683088997] [2019-11-20 08:05:07,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 08:05:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:07,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:05:07,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:07,735 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:07,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:07,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683088997] [2019-11-20 08:05:07,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:07,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-20 08:05:07,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127361398] [2019-11-20 08:05:07,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:05:07,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:07,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:05:07,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:05:07,971 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand 11 states. [2019-11-20 08:05:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:10,654 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2019-11-20 08:05:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:05:10,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-20 08:05:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:10,656 INFO L225 Difference]: With dead ends: 127 [2019-11-20 08:05:10,657 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 08:05:10,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 08:05:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 08:05:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-11-20 08:05:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 08:05:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-20 08:05:10,681 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 20 [2019-11-20 08:05:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:10,682 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-20 08:05:10,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:05:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-11-20 08:05:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:05:10,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:10,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:10,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 08:05:10,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 302239975, now seen corresponding path program 1 times [2019-11-20 08:05:10,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:10,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874089465] [2019-11-20 08:05:10,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 08:05:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:11,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:05:11,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:11,234 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:11,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:11,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874089465] [2019-11-20 08:05:11,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:11,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 08:05:11,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862519057] [2019-11-20 08:05:11,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 08:05:11,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:11,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 08:05:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:05:11,271 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 7 states. [2019-11-20 08:05:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:13,466 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2019-11-20 08:05:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:05:13,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-20 08:05:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:13,482 INFO L225 Difference]: With dead ends: 121 [2019-11-20 08:05:13,482 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 08:05:13,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:05:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 08:05:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-11-20 08:05:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 08:05:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-20 08:05:13,500 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 21 [2019-11-20 08:05:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-20 08:05:13,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 08:05:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-11-20 08:05:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:05:13,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:13,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:13,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 08:05:13,720 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 839109257, now seen corresponding path program 1 times [2019-11-20 08:05:13,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:13,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955776136] [2019-11-20 08:05:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 08:05:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:14,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 08:05:14,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:15,628 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:15,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955776136] [2019-11-20 08:05:15,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:15,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:05:15,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197236869] [2019-11-20 08:05:15,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:05:15,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:05:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:05:15,965 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 13 states. [2019-11-20 08:05:18,171 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-20 08:05:18,463 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 08:05:22,603 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-11-20 08:05:22,992 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-20 08:05:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:24,376 INFO L93 Difference]: Finished difference Result 192 states and 244 transitions. [2019-11-20 08:05:24,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:05:24,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-20 08:05:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:24,378 INFO L225 Difference]: With dead ends: 192 [2019-11-20 08:05:24,378 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 08:05:24,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-20 08:05:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 08:05:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2019-11-20 08:05:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 08:05:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2019-11-20 08:05:24,390 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 21 [2019-11-20 08:05:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:24,390 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2019-11-20 08:05:24,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:05:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2019-11-20 08:05:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:05:24,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:24,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:24,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 08:05:24,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1575840196, now seen corresponding path program 1 times [2019-11-20 08:05:24,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:24,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945512498] [2019-11-20 08:05:24,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 08:05:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:25,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:05:25,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:25,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:25,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945512498] [2019-11-20 08:05:25,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:25,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 08:05:25,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609978200] [2019-11-20 08:05:25,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:05:25,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:05:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:05:25,490 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 14 states. [2019-11-20 08:05:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:27,129 INFO L93 Difference]: Finished difference Result 135 states and 171 transitions. [2019-11-20 08:05:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:05:27,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-20 08:05:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:27,494 INFO L225 Difference]: With dead ends: 135 [2019-11-20 08:05:27,494 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 08:05:27,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:05:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 08:05:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2019-11-20 08:05:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 08:05:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2019-11-20 08:05:27,507 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 22 [2019-11-20 08:05:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:27,508 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2019-11-20 08:05:27,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:05:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2019-11-20 08:05:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:05:27,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:27,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:27,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 08:05:27,713 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash 328100550, now seen corresponding path program 1 times [2019-11-20 08:05:27,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:05:27,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966186417] [2019-11-20 08:05:27,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 08:05:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:28,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:05:28,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:28,127 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:05:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:05:28,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966186417] [2019-11-20 08:05:28,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:28,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 08:05:28,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399439652] [2019-11-20 08:05:28,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 08:05:28,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:05:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 08:05:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:05:28,244 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand 12 states. [2019-11-20 08:06:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:05,468 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2019-11-20 08:06:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:06:05,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 08:06:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:05,565 INFO L225 Difference]: With dead ends: 177 [2019-11-20 08:06:05,565 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 08:06:05,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-20 08:06:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 08:06:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2019-11-20 08:06:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 08:06:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2019-11-20 08:06:05,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 23 [2019-11-20 08:06:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:05,576 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2019-11-20 08:06:05,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 08:06:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2019-11-20 08:06:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:06:05,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:05,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:05,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 08:06:05,805 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -105632341, now seen corresponding path program 1 times [2019-11-20 08:06:05,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:06:05,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744869987] [2019-11-20 08:06:05,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 08:06:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:06,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:06:06,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:06,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:06:06,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:06,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744869987] [2019-11-20 08:06:06,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:06:06,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:06:06,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503983136] [2019-11-20 08:06:06,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:06:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:06:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:06:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:06:06,221 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 13 states. [2019-11-20 08:06:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:38,049 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2019-11-20 08:06:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 08:06:38,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 08:06:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:38,051 INFO L225 Difference]: With dead ends: 124 [2019-11-20 08:06:38,051 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 08:06:38,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-11-20 08:06:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 08:06:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2019-11-20 08:06:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 08:06:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2019-11-20 08:06:38,061 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 23 [2019-11-20 08:06:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:38,061 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2019-11-20 08:06:38,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:06:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2019-11-20 08:06:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:06:38,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:38,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:38,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 08:06:38,263 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2123579340, now seen corresponding path program 1 times [2019-11-20 08:06:38,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:06:38,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875205370] [2019-11-20 08:06:38,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-20 08:06:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:38,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 08:06:38,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:40,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:40,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:06:40,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:40,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875205370] [2019-11-20 08:06:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:06:40,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:06:40,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992424809] [2019-11-20 08:06:40,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:06:40,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:06:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:06:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=126, Unknown=1, NotChecked=0, Total=156 [2019-11-20 08:06:40,866 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand 13 states. [2019-11-20 08:06:45,099 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 08:06:45,417 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-11-20 08:06:46,436 WARN L191 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-20 08:06:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:49,382 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2019-11-20 08:06:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:06:49,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 08:06:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:49,385 INFO L225 Difference]: With dead ends: 176 [2019-11-20 08:06:49,385 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 08:06:49,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=88, Invalid=217, Unknown=1, NotChecked=0, Total=306 [2019-11-20 08:06:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 08:06:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-11-20 08:06:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 08:06:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-20 08:06:49,395 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 23 [2019-11-20 08:06:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:49,396 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-20 08:06:49,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:06:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-20 08:06:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:06:49,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:49,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:49,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-20 08:06:49,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash -640851047, now seen corresponding path program 1 times [2019-11-20 08:06:49,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:06:49,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457955122] [2019-11-20 08:06:49,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-20 08:06:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:49,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 08:06:49,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:50,021 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:06:50,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:50,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457955122] [2019-11-20 08:06:50,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:06:50,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-20 08:06:50,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497746406] [2019-11-20 08:06:50,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:06:50,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:06:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:06:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:06:50,322 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 16 states. [2019-11-20 08:06:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:54,263 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-11-20 08:06:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:06:54,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 08:06:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:54,264 INFO L225 Difference]: With dead ends: 100 [2019-11-20 08:06:54,264 INFO L226 Difference]: Without dead ends: 88 [2019-11-20 08:06:54,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-11-20 08:06:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-20 08:06:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-20 08:06:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 08:06:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-11-20 08:06:54,274 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 23 [2019-11-20 08:06:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:54,274 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-11-20 08:06:54,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:06:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-11-20 08:06:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 08:06:54,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:54,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:54,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-20 08:06:54,476 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 941904828, now seen corresponding path program 1 times [2019-11-20 08:06:54,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:06:54,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67880025] [2019-11-20 08:06:54,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-20 08:06:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:54,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 08:06:54,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:54,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:54,779 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:06:54,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:06:54,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67880025] [2019-11-20 08:06:54,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:06:54,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:06:54,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535082150] [2019-11-20 08:06:54,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:06:54,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:06:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:06:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:06:54,964 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 14 states. [2019-11-20 08:06:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:56,226 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2019-11-20 08:06:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 08:06:56,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-20 08:06:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:56,227 INFO L225 Difference]: With dead ends: 97 [2019-11-20 08:06:56,227 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 08:06:56,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:06:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 08:06:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-20 08:06:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 08:06:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-11-20 08:06:56,239 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 25 [2019-11-20 08:06:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:56,239 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-11-20 08:06:56,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:06:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-11-20 08:06:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:06:56,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:56,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:56,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-20 08:06:56,444 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 782702068, now seen corresponding path program 1 times [2019-11-20 08:06:56,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:06:56,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522742659] [2019-11-20 08:06:56,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-20 08:07:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:00,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 08:07:00,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:07:00,836 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:07:01,692 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:07:02,981 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:07:04,483 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:07:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:07:05,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522742659] [2019-11-20 08:07:05,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:07:05,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 08:07:05,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511125907] [2019-11-20 08:07:05,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:07:05,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:07:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:07:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:07:05,122 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 10 states. [2019-11-20 08:07:10,902 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 08:07:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:44,918 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2019-11-20 08:07:45,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:07:45,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-20 08:07:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:45,017 INFO L225 Difference]: With dead ends: 147 [2019-11-20 08:07:45,017 INFO L226 Difference]: Without dead ends: 132 [2019-11-20 08:07:45,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:07:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-20 08:07:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 79. [2019-11-20 08:07:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 08:07:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-20 08:07:45,026 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 26 [2019-11-20 08:07:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:45,026 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-20 08:07:45,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:07:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-11-20 08:07:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 08:07:45,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:07:45,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:07:45,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-20 08:07:45,227 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:07:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:07:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -485446016, now seen corresponding path program 1 times [2019-11-20 08:07:45,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:07:45,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067086779] [2019-11-20 08:07:45,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-20 08:07:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:45,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 08:07:45,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:45,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:07:45,672 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:07:45,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:07:46,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067086779] [2019-11-20 08:07:46,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:07:46,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2019-11-20 08:07:46,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72065648] [2019-11-20 08:07:46,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:07:46,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:07:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:07:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:07:46,038 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 20 states. [2019-11-20 08:08:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:08:13,187 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2019-11-20 08:08:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 08:08:13,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-11-20 08:08:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:08:13,189 INFO L225 Difference]: With dead ends: 86 [2019-11-20 08:08:13,189 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 08:08:13,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-11-20 08:08:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 08:08:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 08:08:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 08:08:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-11-20 08:08:13,199 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2019-11-20 08:08:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:08:13,200 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-11-20 08:08:13,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:08:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-11-20 08:08:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:08:13,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:08:13,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:08:13,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-20 08:08:13,401 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:08:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:08:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1972844972, now seen corresponding path program 1 times [2019-11-20 08:08:13,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:08:13,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963239365] [2019-11-20 08:08:13,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-20 08:08:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:08:14,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:08:14,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:08:14,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:14,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:08:14,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:14,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963239365] [2019-11-20 08:08:14,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:08:14,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-20 08:08:14,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820902791] [2019-11-20 08:08:14,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:08:14,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:08:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:08:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:08:14,811 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 11 states. [2019-11-20 08:08:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:08:18,333 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2019-11-20 08:08:18,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:08:18,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-11-20 08:08:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:08:18,334 INFO L225 Difference]: With dead ends: 78 [2019-11-20 08:08:18,335 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 08:08:18,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-11-20 08:08:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 08:08:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 08:08:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 08:08:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-20 08:08:18,346 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 37 [2019-11-20 08:08:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:08:18,347 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-20 08:08:18,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:08:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-11-20 08:08:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:08:18,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:08:18,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:08:18,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-20 08:08:18,573 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:08:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:08:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash -515625948, now seen corresponding path program 1 times [2019-11-20 08:08:18,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:08:18,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416411187] [2019-11-20 08:08:18,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-20 08:08:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:08:19,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 08:08:19,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:08:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:20,350 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:08:20,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416411187] [2019-11-20 08:08:20,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:08:20,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:08:20,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939459060] [2019-11-20 08:08:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:08:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:08:20,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:08:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:08:20,794 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 13 states. [2019-11-20 08:08:24,916 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 08:08:27,031 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-11-20 08:08:31,282 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-20 08:08:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:08:31,289 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2019-11-20 08:08:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:08:31,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-11-20 08:08:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:08:31,291 INFO L225 Difference]: With dead ends: 78 [2019-11-20 08:08:31,291 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 08:08:31,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-20 08:08:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 08:08:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 08:08:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 08:08:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-11-20 08:08:31,302 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 40 [2019-11-20 08:08:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:08:31,302 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-11-20 08:08:31,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:08:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2019-11-20 08:08:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:08:31,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:08:31,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:08:31,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-20 08:08:31,513 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:08:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:08:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 169266622, now seen corresponding path program 1 times [2019-11-20 08:08:31,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:08:31,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342225798] [2019-11-20 08:08:31,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-20 08:08:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:08:32,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 08:08:32,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:08:32,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2019-11-20 08:08:32,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:08:32,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:32,945 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:08:33,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:33,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 08:08:33,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:56 [2019-11-20 08:08:34,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2019-11-20 08:08:34,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:08:34,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:34,626 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:08:34,768 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 08:08:34,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:34,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 08:08:34,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:164, output treesize:125 [2019-11-20 08:08:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:35,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:08:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:08:36,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-11-20 08:08:36,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:08:36,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:36,166 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:08:36,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:36,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:08:36,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:36 [2019-11-20 08:08:37,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2019-11-20 08:08:37,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:08:38,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:38,007 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:08:38,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:08:38,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:08:38,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:74 [2019-11-20 08:08:49,746 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) .cse1)) (fp.eq .cse0 (fp.neg (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse1)) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)))))) is different from true [2019-11-20 08:08:52,191 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 ULTIMATE.start___ieee754_atan2_~x))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) .cse1)) (fp.eq .cse0 (fp.neg (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse1)) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)))))) is different from true [2019-11-20 08:08:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:08:52,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342225798] [2019-11-20 08:08:52,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:08:52,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 32 [2019-11-20 08:08:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6803383] [2019-11-20 08:08:52,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 08:08:52,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:08:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 08:08:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=782, Unknown=3, NotChecked=114, Total=992 [2019-11-20 08:08:52,219 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 32 states. [2019-11-20 08:09:05,121 WARN L191 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 08:09:18,834 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 08:09:33,115 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 08:09:48,798 WARN L191 SmtUtils]: Spent 3.07 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 08:10:02,499 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 08:10:06,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) c_ULTIMATE.start_atan_double_~x))) (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) c_ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) .cse0)) (fp.eq .cse0 (fp.neg (_ +zero 11 53))) (not (= c_ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) c_ULTIMATE.start_atan_double_~ix~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) c_ULTIMATE.start_atan_double_~x))) (= .cse2 c_ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) c_ULTIMATE.start_atan_double_~x) (= .cse4 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse4)))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|) c_ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) c_ULTIMATE.start_atan_double_~x))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= .cse5 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse5) (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |c_ULTIMATE.start_fabs_double_#res|)))) (= c_ULTIMATE.start_main_~y~0 .cse2) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) c_ULTIMATE.start_fabs_double_~x) (= .cse8 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse8)))))) is different from false [2019-11-20 08:10:14,603 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 08:10:24,151 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:10:49,584 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 08:11:43,274 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 88 [2019-11-20 08:11:53,346 WARN L191 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 08:12:01,506 WARN L191 SmtUtils]: Spent 4.88 s on a formula simplification that was a NOOP. DAG size: 93 [2019-11-20 08:12:23,293 WARN L191 SmtUtils]: Spent 8.41 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 08:12:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:33,059 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-11-20 08:12:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 08:12:33,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-11-20 08:12:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:33,062 INFO L225 Difference]: With dead ends: 107 [2019-11-20 08:12:33,062 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 08:12:33,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 121.8s TimeCoverageRelationStatistics Valid=305, Invalid=1678, Unknown=9, NotChecked=264, Total=2256 [2019-11-20 08:12:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 08:12:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2019-11-20 08:12:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 08:12:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-11-20 08:12:33,100 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 43 [2019-11-20 08:12:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:33,100 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-11-20 08:12:33,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 08:12:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-11-20 08:12:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:12:33,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:33,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:12:33,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-20 08:12:33,313 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1684291623, now seen corresponding path program 1 times [2019-11-20 08:12:33,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:12:33,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595691124] [2019-11-20 08:12:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-20 08:12:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:34,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 08:12:34,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:12:34,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 08:12:34,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 08:12:34,677 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:34,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:34,680 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:34,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:34,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:34,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2019-11-20 08:12:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:35,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:12:36,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-11-20 08:12:36,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 08:12:36,423 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:36,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:36,427 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:36,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:12:36,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:12:36,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:36 [2019-11-20 08:12:41,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) (_ bv1141899264 32))))) is different from false [2019-11-20 08:12:43,708 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) (_ bv1141899264 32))))) is different from true [2019-11-20 08:12:46,183 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_atan2_#in~x_19| (_ FloatingPoint 11 53))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 |v_ULTIMATE.start___ieee754_atan2_#in~x_19|))) (not (fp.gt |v_ULTIMATE.start___ieee754_atan2_#in~x_19| (_ +zero 11 53))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) (_ bv1141899264 32))))) is different from true [2019-11-20 08:12:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:46,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595691124] [2019-11-20 08:12:46,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:46,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 08:12:46,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577931864] [2019-11-20 08:12:46,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:12:46,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:12:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:12:46,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=263, Unknown=4, NotChecked=66, Total=380 [2019-11-20 08:12:46,203 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 20 states. [2019-11-20 08:12:52,706 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 08:12:53,159 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 08:12:53,719 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 08:12:54,242 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 08:13:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:13:06,726 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-11-20 08:13:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:13:06,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-20 08:13:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:13:06,727 INFO L225 Difference]: With dead ends: 107 [2019-11-20 08:13:06,727 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 08:13:06,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=150, Invalid=504, Unknown=4, NotChecked=98, Total=756 [2019-11-20 08:13:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 08:13:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-11-20 08:13:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 08:13:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2019-11-20 08:13:06,742 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 43 [2019-11-20 08:13:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:13:06,742 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2019-11-20 08:13:06,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:13:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2019-11-20 08:13:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 08:13:06,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:13:06,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:13:06,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-20 08:13:06,961 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:13:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:13:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1395825074, now seen corresponding path program 1 times [2019-11-20 08:13:06,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:13:06,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606466538] [2019-11-20 08:13:06,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-20 08:13:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:13,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 08:13:13,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:13:13,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 08:13:13,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 08:13:13,581 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:13,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:13:13,587 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:13,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:13:13,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:13,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:48 [2019-11-20 08:13:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:15,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:13:17,915 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:13:21,079 WARN L191 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 08:13:23,831 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 08:13:25,616 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 08:13:29,198 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 08:13:34,730 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 08:13:34,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 95 [2019-11-20 08:13:34,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-11-20 08:13:34,741 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:35,540 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 08:13:35,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:13:35,540 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:36,375 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 08:13:36,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:13:36,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:13:36,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:60 [2019-11-20 08:13:40,458 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 08:13:50,462 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 08:13:53,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_28 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32))) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0)))) is different from false [2019-11-20 08:13:55,968 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_28 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32))) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0)))) is different from true [2019-11-20 08:14:00,185 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_28 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32))) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 ULTIMATE.start___ieee754_atan2_~x)))))) is different from true [2019-11-20 08:14:12,807 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 08:14:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:14:12,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606466538] [2019-11-20 08:14:12,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:14:12,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 23 [2019-11-20 08:14:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328956009] [2019-11-20 08:14:12,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 08:14:12,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:14:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 08:14:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=331, Unknown=7, NotChecked=82, Total=552 [2019-11-20 08:14:12,825 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 24 states. [2019-11-20 08:14:21,160 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-11-20 08:14:34,418 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 08:14:36,190 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 08:14:37,303 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 08:14:38,689 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 08:14:39,400 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 08:14:39,843 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 08:14:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:14:40,063 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-11-20 08:14:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 08:14:40,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-11-20 08:14:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:14:40,078 INFO L225 Difference]: With dead ends: 71 [2019-11-20 08:14:40,078 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 08:14:40,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 69.5s TimeCoverageRelationStatistics Valid=291, Invalid=640, Unknown=7, NotChecked=118, Total=1056 [2019-11-20 08:14:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 08:14:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-20 08:14:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 08:14:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2019-11-20 08:14:40,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 46 [2019-11-20 08:14:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:14:40,091 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2019-11-20 08:14:40,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 08:14:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2019-11-20 08:14:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 08:14:40,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:14:40,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:14:40,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-20 08:14:40,293 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:14:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:14:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1037103853, now seen corresponding path program 1 times [2019-11-20 08:14:40,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:14:40,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493932680] [2019-11-20 08:14:40,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_998560de-8749-4e70-9956-d1011d2fd574/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-20 08:14:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:14:41,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 08:14:41,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:14:41,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2019-11-20 08:14:41,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2019-11-20 08:14:41,607 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:41,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:41,615 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:41,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:41,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:41,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:21 [2019-11-20 08:14:42,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 08:14:42,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 08:14:42,370 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:42,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:42,374 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:42,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:42,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:42,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:73 [2019-11-20 08:14:42,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:14:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:14:43,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:14:43,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:14:45,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-11-20 08:14:45,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 08:14:45,087 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:45,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:45,092 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:45,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:14:45,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:14:45,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:36 [2019-11-20 08:14:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:14:49,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493932680] [2019-11-20 08:14:49,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:14:49,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 18] imperfect sequences [] total 32 [2019-11-20 08:14:49,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109675596] [2019-11-20 08:14:49,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 08:14:49,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:14:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 08:14:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=905, Unknown=1, NotChecked=0, Total=992 [2019-11-20 08:14:49,153 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand 32 states. [2019-11-20 08:14:56,592 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 08:14:57,933 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 08:14:58,590 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:14:59,270 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 08:14:59,966 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 08:15:02,904 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 08:15:05,102 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 08:15:09,348 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 08:15:13,813 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 93 [2019-11-20 08:15:18,865 WARN L191 SmtUtils]: Spent 4.89 s on a formula simplification that was a NOOP. DAG size: 98 [2019-11-20 08:15:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:15:19,121 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2019-11-20 08:15:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 08:15:19,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-11-20 08:15:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:15:19,129 INFO L225 Difference]: With dead ends: 48 [2019-11-20 08:15:19,129 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 08:15:19,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=448, Invalid=1713, Unknown=1, NotChecked=0, Total=2162 [2019-11-20 08:15:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 08:15:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 08:15:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 08:15:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 08:15:19,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-20 08:15:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:15:19,130 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:15:19,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 08:15:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:15:19,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 08:15:19,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-20 08:15:19,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 08:15:19,501 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 349 [2019-11-20 08:15:19,721 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 587 DAG size of output: 529 [2019-11-20 08:15:19,958 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 481 [2019-11-20 08:15:20,074 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 500 DAG size of output: 456 [2019-11-20 08:15:27,389 WARN L191 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 347 DAG size of output: 174 [2019-11-20 08:16:02,904 WARN L191 SmtUtils]: Spent 35.47 s on a formula simplification. DAG size of input: 523 DAG size of output: 214 [2019-11-20 08:16:10,958 WARN L191 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 289 DAG size of output: 162 [2019-11-20 08:16:18,819 WARN L191 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 360 DAG size of output: 182 [2019-11-20 08:16:33,228 WARN L191 SmtUtils]: Spent 14.41 s on a formula simplification. DAG size of input: 301 DAG size of output: 169 [2019-11-20 08:16:37,662 WARN L191 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 143 DAG size of output: 73 [2019-11-20 08:17:02,931 WARN L191 SmtUtils]: Spent 25.26 s on a formula simplification. DAG size of input: 475 DAG size of output: 189 [2019-11-20 08:17:07,157 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 141 DAG size of output: 71 [2019-11-20 08:17:11,701 WARN L191 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 186 DAG size of output: 94 [2019-11-20 08:17:17,490 WARN L191 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-20 08:17:27,323 WARN L191 SmtUtils]: Spent 9.83 s on a formula simplification. DAG size of input: 450 DAG size of output: 84 [2019-11-20 08:17:27,326 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 08:17:27,326 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-20 08:17:27,327 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: (let ((.cse10 (fp.neg (_ +zero 11 53)))) (and (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) .cse0)) (fp.eq .cse0 (fp.neg (_ +zero 11 53))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (= ULTIMATE.start_atan_double_~x (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ULTIMATE.start_atan_double_~x) (= .cse4 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse4)))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse6 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse5) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse6) (= .cse5 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse6) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))) (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= .cse8 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse8) (= (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) |ULTIMATE.start_fabs_double_#res|)))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))))) (= ULTIMATE.start_main_~y~0 .cse10) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse11) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse11 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse12 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse10 ULTIMATE.start___ieee754_atan2_~y) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~k~0 (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32))))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) [2019-11-20 08:17:27,327 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-20 08:17:27,327 INFO L444 ceAbstractionStarter]: For program point L267(lines 267 274) no Hoare annotation was computed. [2019-11-20 08:17:27,327 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L267-2(lines 267 274) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L270(line 270) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L270-2(lines 270 273) no Hoare annotation was computed. [2019-11-20 08:17:27,328 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L271(line 271) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-20 08:17:27,329 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (let ((.cse3 (= ~zero_atan2~0 (_ +zero 11 53))) (.cse4 (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse6 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse7 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse6) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse7) (= .cse6 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse7) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53)))))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse5) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse5 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53)))))) (.cse2 (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))))) (or (and (= .cse0 |ULTIMATE.start_atan_double_#res|) (= ULTIMATE.start_atan_double_~x .cse0) (and .cse1 .cse2 .cse3 .cse4 (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)))))) (and .cse3 .cse4 (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) .cse1 .cse2 (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6)))))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= |ULTIMATE.start___ieee754_atan2_#res| .cse0) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L447 ceAbstractionStarter]: At program point L276(lines 256 277) the Hoare annotation is: true [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-20 08:17:27,330 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-20 08:17:27,331 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-20 08:17:27,331 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-20 08:17:27,331 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ~zero_atan2~0 (_ +zero 11 53)) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_main_~y~0 .cse0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0))) [2019-11-20 08:17:27,331 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-20 08:17:27,331 INFO L444 ceAbstractionStarter]: For program point L247-1(lines 247 251) no Hoare annotation was computed. [2019-11-20 08:17:27,331 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 08:17:27,332 INFO L440 ceAbstractionStarter]: At program point L247-2(lines 247 251) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (let ((.cse1 (and (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse21 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse22 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse21) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse22) (= .cse21 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse22) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse23 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse23) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse23 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) |ULTIMATE.start_main_#t~short53| (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) (.cse2 (= ULTIMATE.start_main_~y~0 .cse0))) (or (and (= ULTIMATE.start_main_~res~0 .cse0) .cse1 (= |ULTIMATE.start___ieee754_atan2_#res| .cse0) .cse2 (= ULTIMATE.start___signbit_double_~x .cse0)) (and (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (= ULTIMATE.start___ieee754_atan2_~z~1 (let ((.cse3 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse4 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse5) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse5)))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |ULTIMATE.start_atan_double_#res|)) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) |ULTIMATE.start_fabs_double_#res|))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) ULTIMATE.start_atan_double_~ix~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (= |ULTIMATE.start___ieee754_atan2_#res| (let ((.cse8 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse9 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) .cse10) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse10)))) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| .cse1 (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) .cse2) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse11 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ULTIMATE.start_fabs_double_~x))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse12 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) .cse13) (= ULTIMATE.start___ieee754_atan2_~zh~0 ((_ extract 63 32) v_skolemized_v_prenex_30_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse13)))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start___signbit_double_~x (let ((.cse14 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14)))) (= (let ((.cse15 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) .cse16) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse16)))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~hx~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse17 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ULTIMATE.start_atan_double_~x))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse20 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start_main_~res~0 (let ((.cse18 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18)))) (= (let ((.cse19 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))) .cse20) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse20)))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)) |ULTIMATE.start_atan_double_#res|))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))))))) [2019-11-20 08:17:27,332 INFO L444 ceAbstractionStarter]: For program point L247-3(lines 247 251) no Hoare annotation was computed. [2019-11-20 08:17:27,332 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-20 08:17:27,332 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-20 08:17:27,332 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 08:17:27,333 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 08:17:27,333 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 08:17:27,334 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: (let ((.cse2 (fp.neg (_ +zero 11 53)))) (and (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse1 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse1) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse1) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) (= ULTIMATE.start_main_~y~0 .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse3) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse3 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse2 ULTIMATE.start___ieee754_atan2_~y) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~k~0 (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32))))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) [2019-11-20 08:17:27,334 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 08:17:27,334 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 08:17:27,334 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 08:17:27,334 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-20 08:17:27,334 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-20 08:17:27,334 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 08:17:27,335 INFO L440 ceAbstractionStarter]: At program point L253(lines 244 254) the Hoare annotation is: (let ((.cse24 (fp.neg (_ +zero 11 53)))) (let ((.cse1 (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (and (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse25 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse26 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse25) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse26) (= .cse25 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse26) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse27 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse27) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse27 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) |ULTIMATE.start_main_#t~short53| (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse24 ULTIMATE.start___ieee754_atan2_~y) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) (.cse6 (= ULTIMATE.start_main_~y~0 .cse24))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_fabs_double_#res|))) .cse1 (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (= |ULTIMATE.start___ieee754_atan2_#res| (let ((.cse2 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse3 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) .cse4) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse4)))) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| .cse5 (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) .cse6) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_skolemized_v_prenex_31_6 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_31_6)) (= (let ((.cse7 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse8) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse8) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_31_6) ((_ extract 62 52) v_skolemized_v_prenex_31_6) ((_ extract 51 0) v_skolemized_v_prenex_31_6)) (let ((.cse9 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse10 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) .cse11) (= ULTIMATE.start___ieee754_atan2_~zh~0 ((_ extract 63 32) v_skolemized_v_prenex_30_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse11)))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~hx~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start_main_~res~0 (let ((.cse12 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (= (let ((.cse13 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) .cse14) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse14)))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)) |ULTIMATE.start_atan_double_#res|))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|))) (= ULTIMATE.start_atan_double_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse17 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (= ULTIMATE.start___ieee754_atan2_~z~1 (let ((.cse15 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15)))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (let ((.cse16 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))) .cse17) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse17)))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= (let ((.cse18 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18))) |ULTIMATE.start_atan_double_#res|)) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse19 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))) ULTIMATE.start_fabs_double_~x))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_skolemized_v_prenex_30_4 (_ BitVec 64)) (v_arrayElimCell_32 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (let ((.cse22 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start___signbit_double_~x (let ((.cse20 (concat (bvxor (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_30_4)) v_arrayElimCell_32))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20)))) (= (let ((.cse21 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_30))) (fp ((_ extract 63 63) .cse21) ((_ extract 62 52) .cse21) ((_ extract 51 0) .cse21))) .cse22) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_30_4) ((_ extract 62 52) v_skolemized_v_prenex_30_4) ((_ extract 51 0) v_skolemized_v_prenex_30_4)) .cse22)))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse23 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))) ULTIMATE.start_atan_double_~x))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)))))) (and (= ULTIMATE.start_main_~res~0 .cse24) .cse1 .cse5 (exists ((v_skolemized_v_prenex_31_4 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_31_4) ((_ extract 62 52) v_skolemized_v_prenex_31_4) ((_ extract 51 0) v_skolemized_v_prenex_31_4))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_31_4)))) (= |ULTIMATE.start___ieee754_atan2_#res| .cse24) .cse6 (= ULTIMATE.start___signbit_double_~x .cse24))))) [2019-11-20 08:17:27,335 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-20 08:17:27,335 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-20 08:17:27,336 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ~zero_atan2~0 (_ +zero 11 53)) (= .cse1 ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_main_~y~0 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0))) [2019-11-20 08:17:27,336 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 08:17:27,336 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-20 08:17:27,336 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 08:17:27,336 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 08:17:27,336 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 08:17:27,343 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 08:17:27,343 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-20 08:17:27,343 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-20 08:17:27,343 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-20 08:17:27,344 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 08:17:27,345 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 08:17:27,345 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-20 08:17:27,345 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: (let ((.cse5 (fp.neg (_ +zero 11 53)))) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|))) (= ULTIMATE.start_atan_double_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) |ULTIMATE.start_atan_double_#res|))) (exists ((v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_atan_double_~x) (= .cse1 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse1)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))))) (= ULTIMATE.start_main_~y~0 .cse5) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |ULTIMATE.start_atan_double_#res|) (= .cse7 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse7)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse8 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse8) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse8 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= .cse9 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ULTIMATE.start___ieee754_atan2_~z~1) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse9)))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse11 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11)))))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (let ((.cse12 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|) ULTIMATE.start_atan_double_~hx~0))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)) ULTIMATE.start___ieee754_atan2_~z~1))) (= .cse5 ULTIMATE.start___ieee754_atan2_~y) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~k~0 (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32))))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|))))))) [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-20 08:17:27,346 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 08:17:27,347 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: (let ((.cse7 (fp.neg (_ +zero 11 53)))) (and (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) .cse0)) (fp.eq .cse0 (fp.neg (_ +zero 11 53))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= .cse5 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse5) (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |ULTIMATE.start_fabs_double_#res|)))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))))) (= ULTIMATE.start_main_~y~0 .cse7) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse8 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse8) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse8 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse7 ULTIMATE.start___ieee754_atan2_~y) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~k~0 (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32))))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))))) [2019-11-20 08:17:27,347 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-20 08:17:27,347 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-20 08:17:27,347 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-20 08:17:27,347 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-20 08:17:27,347 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-20 08:17:27,347 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 08:17:27,348 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 08:17:27,348 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 08:17:27,348 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= .cse1 |ULTIMATE.start_atan_double_#res|) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse1 ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_atan_double_~x .cse1) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (= ULTIMATE.start_main_~y~0 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0))) [2019-11-20 08:17:27,348 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-20 08:17:27,348 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-20 08:17:27,348 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-20 08:17:27,349 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: (let ((.cse5 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|))) (= ULTIMATE.start_atan_double_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) |ULTIMATE.start_atan_double_#res|))) (exists ((v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_atan_double_~x) (= .cse1 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse1)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (= (_ bv1 32) ULTIMATE.start___ieee754_atan2_~m~0) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))))) (= ULTIMATE.start_main_~y~0 .cse5) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (and (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |ULTIMATE.start_atan_double_#res|) (= .cse7 (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse7)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse8 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse8) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse8 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|) ULTIMATE.start_atan_double_~hx~0))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= .cse5 ULTIMATE.start___ieee754_atan2_~y) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (= ULTIMATE.start___ieee754_atan2_~k~0 (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_7)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32))))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|))))))) [2019-11-20 08:17:27,349 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 08:17:27,349 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-20 08:17:27,349 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 08:17:27,349 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 271) no Hoare annotation was computed. [2019-11-20 08:17:27,349 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 08:17:27,350 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 08:17:27,350 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse1 ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse3) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse3) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_atan_double_~x .cse1) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (= ULTIMATE.start_main_~y~0 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0))) [2019-11-20 08:17:27,361 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-20 08:17:27,367 INFO L168 Benchmark]: Toolchain (without parser) took 793626.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -201.0 MB). Peak memory consumption was 353.1 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,367 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:17:27,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -198.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,370 INFO L168 Benchmark]: Boogie Preprocessor took 81.00 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,370 INFO L168 Benchmark]: RCFGBuilder took 38286.83 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: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,371 INFO L168 Benchmark]: TraceAbstraction took 754676.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.0 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:17:27,374 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -198.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.00 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38286.83 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: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 754676.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.0 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 271]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...