./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.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_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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 427f5a1297639616b7c4f6533641105ea064cfe8 ........................................................................................................................................................................................................................................................................................................................ 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_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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 427f5a1297639616b7c4f6533641105ea064cfe8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:54:15,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:54:15,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:54:15,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:54:15,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:54:15,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:54:15,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:54:15,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:54:15,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:54:15,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:54:15,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:54:15,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:54:15,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:54:15,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:54:15,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:54:15,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:54:15,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:54:15,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:54:15,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:54:15,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:54:15,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:54:15,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:54:15,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:54:15,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:54:15,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:54:15,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:54:15,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:54:15,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:54:15,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:54:15,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:54:15,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:54:15,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:54:15,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:54:15,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:54:15,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:54:15,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:54:15,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:54:15,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:54:15,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:54:15,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:54:15,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:54:15,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:54:15,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:54:15,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:54:15,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:54:15,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:54:15,879 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:54:15,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:54:15,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:54:15,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:54:15,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:54:15,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:54:15,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:54:15,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:54:15,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:54:15,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:54:15,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:54:15,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:54:15,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:54:15,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:54:15,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:54:15,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:54:15,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:54:15,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:54:15,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:54:15,884 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_67979765-863a-404b-a8f0-fa81d7cf41a8/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 -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2019-11-20 08:54:16,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:54:16,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:54:16,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:54:16,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:54:16,028 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:54:16,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-20 08:54:16,089 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/474a3e457/ca95188967d84854854fb737740e678c/FLAGaa7a1d26c [2019-11-20 08:54:16,515 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:54:16,516 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-20 08:54:16,524 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/474a3e457/ca95188967d84854854fb737740e678c/FLAGaa7a1d26c [2019-11-20 08:54:16,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/474a3e457/ca95188967d84854854fb737740e678c [2019-11-20 08:54:16,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:54:16,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:54:16,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:54:16,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:54:16,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:54:16,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:16" (1/1) ... [2019-11-20 08:54:16,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73157f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:16, skipping insertion in model container [2019-11-20 08:54:16,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:16" (1/1) ... [2019-11-20 08:54:16,936 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:54:16,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:54:17,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:54:17,249 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:54:17,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:54:17,323 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:54:17,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17 WrapperNode [2019-11-20 08:54:17,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:54:17,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:54:17,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:54:17,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:54:17,332 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:54:17" (1/1) ... [2019-11-20 08:54:17,347 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:54:17" (1/1) ... [2019-11-20 08:54:17,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:54:17,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:54:17,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:54:17,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:54:17,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... [2019-11-20 08:54:17,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:54:17,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:54:17,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:54:17,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:54:17,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:54:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 08:54:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 08:54:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 08:54:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 08:54:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:54:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:54:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 08:54:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 08:54:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:54:18,497 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:54:18,497 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 08:54:18,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:18 BoogieIcfgContainer [2019-11-20 08:54:18,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:54:18,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:54:18,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:54:18,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:54:18,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:54:16" (1/3) ... [2019-11-20 08:54:18,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7071ef3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:18, skipping insertion in model container [2019-11-20 08:54:18,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:17" (2/3) ... [2019-11-20 08:54:18,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7071ef3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:18, skipping insertion in model container [2019-11-20 08:54:18,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:18" (3/3) ... [2019-11-20 08:54:18,504 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2019-11-20 08:54:18,510 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:54:18,515 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:54:18,522 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:54:18,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:54:18,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:54:18,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:54:18,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:54:18,549 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:54:18,549 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:54:18,550 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:54:18,550 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:54:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 08:54:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:54:18,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:54:18,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:54:18,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:54:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:54:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 08:54:18,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:54:18,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936672989] [2019-11-20 08:54:18,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:54:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:54:18,714 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:54:18,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936672989] [2019-11-20 08:54:18,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:54:18,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:54:18,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861056690] [2019-11-20 08:54:18,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 08:54:18,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:54:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 08:54:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:54:18,734 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 08:54:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:54:18,762 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 08:54:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 08:54:18,764 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 08:54:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:54:18,774 INFO L225 Difference]: With dead ends: 227 [2019-11-20 08:54:18,775 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 08:54:18,778 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:54:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 08:54:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 08:54:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 08:54:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 08:54:18,820 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 08:54:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:54:18,820 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 08:54:18,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 08:54:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 08:54:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:54:18,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:54:18,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:54:18,822 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:54:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:54:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 08:54:18,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:54:18,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671402828] [2019-11-20 08:54:18,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:54:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:54:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:54:19,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:54:19,032 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 08:54:19,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:54:19 BoogieIcfgContainer [2019-11-20 08:54:19,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:54:19,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:54:19,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:54:19,078 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:54:19,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:18" (3/4) ... [2019-11-20 08:54:19,082 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 08:54:19,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:54:19,084 INFO L168 Benchmark]: Toolchain (without parser) took 2163.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -78.2 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:54:19,085 INFO L168 Benchmark]: CDTParser took 0.17 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:54:19,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 08:54:19,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:54:19,086 INFO L168 Benchmark]: Boogie Preprocessor took 72.54 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:54:19,087 INFO L168 Benchmark]: RCFGBuilder took 1035.87 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:54:19,088 INFO L168 Benchmark]: TraceAbstraction took 578.08 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:54:19,088 INFO L168 Benchmark]: Witness Printer took 4.47 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:54:19,091 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.17 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 403.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.54 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 1035.87 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 578.08 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.47 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: 260]: 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 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. 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] [L251] double x = 0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y < 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] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -pi_o_2 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] [L260] __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, 115 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 164 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=115occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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:54:21,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:54:21,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:54:21,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:54:21,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:54:21,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:54:21,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:54:21,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:54:21,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:54:21,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:54:21,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:54:21,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:54:21,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:54:21,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:54:21,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:54:21,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:54:21,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:54:21,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:54:21,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:54:21,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:54:21,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:54:21,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:54:21,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:54:21,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:54:21,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:54:21,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:54:21,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:54:21,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:54:21,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:54:21,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:54:21,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:54:21,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:54:21,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:54:21,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:54:21,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:54:21,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:54:21,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:54:21,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:54:21,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:54:21,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:54:21,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:54:21,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 08:54:21,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:54:21,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:54:21,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:54:21,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:54:21,128 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:54:21,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:54:21,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:54:21,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:54:21,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:54:21,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:54:21,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:54:21,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:54:21,130 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 08:54:21,130 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 08:54:21,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:54:21,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:54:21,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:54:21,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:54:21,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:54:21,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:54:21,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:54:21,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:54:21,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:54:21,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:54:21,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:54:21,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:54:21,134 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 08:54:21,134 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 08:54:21,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:54:21,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 08:54:21,135 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_67979765-863a-404b-a8f0-fa81d7cf41a8/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 -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2019-11-20 08:54:21,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:54:21,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:54:21,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:54:21,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:54:21,420 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:54:21,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-20 08:54:21,478 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/8633a2f1a/a26642406a604619a2fd7a608ec03e36/FLAG27ac98731 [2019-11-20 08:54:21,903 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:54:21,903 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2019-11-20 08:54:21,913 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/8633a2f1a/a26642406a604619a2fd7a608ec03e36/FLAG27ac98731 [2019-11-20 08:54:22,324 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/data/8633a2f1a/a26642406a604619a2fd7a608ec03e36 [2019-11-20 08:54:22,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:54:22,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:54:22,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:54:22,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:54:22,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:54:22,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:22,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4a2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22, skipping insertion in model container [2019-11-20 08:54:22,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:22,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:54:22,380 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:54:22,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:54:22,654 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:54:22,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:54:22,890 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:54:22,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22 WrapperNode [2019-11-20 08:54:22,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:54:22,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:54:22,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:54:22,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:54:22,900 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:54:22" (1/1) ... [2019-11-20 08:54:22,923 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:54:22" (1/1) ... [2019-11-20 08:54:22,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:54:22,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:54:22,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:54:22,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:54:22,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:22,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:22,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:22,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:23,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:23,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:23,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... [2019-11-20 08:54:23,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:54:23,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:54:23,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:54:23,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:54:23,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:54:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 08:54:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 08:54:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 08:54:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 08:54:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 08:54:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:54:23,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:54:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 08:54:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:54:59,152 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:54:59,153 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 08:54:59,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:59 BoogieIcfgContainer [2019-11-20 08:54:59,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:54:59,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:54:59,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:54:59,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:54:59,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:54:22" (1/3) ... [2019-11-20 08:54:59,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecec3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:59, skipping insertion in model container [2019-11-20 08:54:59,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:22" (2/3) ... [2019-11-20 08:54:59,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecec3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:59, skipping insertion in model container [2019-11-20 08:54:59,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:59" (3/3) ... [2019-11-20 08:54:59,165 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2019-11-20 08:54:59,177 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:54:59,185 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:54:59,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:54:59,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:54:59,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:54:59,236 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:54:59,236 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:54:59,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:54:59,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:54:59,237 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:54:59,237 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:54:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 08:54:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:54:59,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:54:59,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:54:59,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:54:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:54:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 08:54:59,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:54:59,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917988665] [2019-11-20 08:54:59,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:54:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:54:59,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 08:54:59,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:54:59,588 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:54:59,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:54:59,592 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:54:59,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917988665] [2019-11-20 08:54:59,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:54:59,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 08:54:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111420350] [2019-11-20 08:54:59,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 08:54:59,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:54:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 08:54:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:54:59,613 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 08:54:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:54:59,644 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 08:54:59,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 08:54:59,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 08:54:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:54:59,658 INFO L225 Difference]: With dead ends: 227 [2019-11-20 08:54:59,659 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 08:54:59,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 08:54:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 08:54:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 08:54:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 08:54:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 08:54:59,713 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 08:54:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:54:59,713 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 08:54:59,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 08:54:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 08:54:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:54:59,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:54:59,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:54:59,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 08:54:59,915 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:54:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:54:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 08:54:59,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:54:59,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657022099] [2019-11-20 08:54:59,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:00,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 08:55:00,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:00,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 08:55:00,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 24 treesize of output 27 [2019-11-20 08:55:00,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:00,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:00,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:00,637 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:55:00,638 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:00,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:00,643 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:55:00,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:00,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:55:00,669 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:33 [2019-11-20 08:55:00,814 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:55:00,814 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:00,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:00,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 61 [2019-11-20 08:55:01,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 41 [2019-11-20 08:55:01,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:01,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,070 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 41 treesize of output 25 [2019-11-20 08:55:01,071 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:01,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,082 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:55:01,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2019-11-20 08:55:01,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,124 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 19 treesize of output 11 [2019-11-20 08:55:01,125 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:01,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,137 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:55:01,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:01,183 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 2 xjuncts. [2019-11-20 08:55:01,183 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-20 08:55:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:01,597 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:55:01,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657022099] [2019-11-20 08:55:01,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:01,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 08:55:01,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910690634] [2019-11-20 08:55:01,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:55:01,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:55:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:55:01,601 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-20 08:55:06,102 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 08:55:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:07,732 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-20 08:55:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:55:08,147 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-20 08:55:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:08,149 INFO L225 Difference]: With dead ends: 167 [2019-11-20 08:55:08,149 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 08:55:08,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:55:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 08:55:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 08:55:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 08:55:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-11-20 08:55:08,163 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 13 [2019-11-20 08:55:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:08,164 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-11-20 08:55:08,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:55:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-11-20 08:55:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 08:55:08,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:08,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:55:08,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 08:55:08,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2019-11-20 08:55:08,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:08,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593461986] [2019-11-20 08:55:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:08,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:55:08,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:08,953 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:09,190 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:09,476 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:09,480 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:55:09,480 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:11,568 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:55:11,571 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:55:11,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593461986] [2019-11-20 08:55:11,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:11,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 08:55:11,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279456780] [2019-11-20 08:55:11,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:55:11,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:55:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:55:11,574 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 10 states. [2019-11-20 08:55:12,114 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 08:55:12,443 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 08:55:13,609 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 08:55:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:14,294 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-11-20 08:55:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:55:14,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-20 08:55:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:14,297 INFO L225 Difference]: With dead ends: 72 [2019-11-20 08:55:14,297 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 08:55:14,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:55:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 08:55:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 08:55:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 08:55:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-11-20 08:55:14,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 18 [2019-11-20 08:55:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:14,309 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-11-20 08:55:14,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:55:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-11-20 08:55:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:55:14,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:14,311 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:55:14,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 08:55:14,519 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2019-11-20 08:55:14,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:14,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039344160] [2019-11-20 08:55:14,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:14,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:55:14,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:15,281 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:15,458 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:15,581 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 08:55:15,583 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:55:15,583 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:18,094 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 08:55:18,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:55:18,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039344160] [2019-11-20 08:55:18,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:18,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 08:55:18,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140950697] [2019-11-20 08:55:18,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:55:18,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:55:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:55:18,099 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 10 states. [2019-11-20 08:55:18,814 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 08:55:19,634 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 08:55:19,903 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 08:55:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:20,970 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-20 08:55:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:55:20,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 08:55:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:20,985 INFO L225 Difference]: With dead ends: 70 [2019-11-20 08:55:20,985 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 08:55:20,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:55:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 08:55:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 08:55:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 08:55:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-20 08:55:21,006 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 20 [2019-11-20 08:55:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:21,006 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-20 08:55:21,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:55:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-20 08:55:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:55:21,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:21,009 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:55:21,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 08:55:21,225 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-20 08:55:21,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:21,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724645900] [2019-11-20 08:55:21,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:21,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 08:55:21,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:23,835 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:55:23,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:24,197 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:55:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724645900] [2019-11-20 08:55:24,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:24,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 14 [2019-11-20 08:55:24,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048253358] [2019-11-20 08:55:24,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:55:24,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:24,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:55:24,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2019-11-20 08:55:24,199 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 14 states. [2019-11-20 08:55:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:28,819 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-11-20 08:55:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:55:28,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 08:55:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:28,821 INFO L225 Difference]: With dead ends: 83 [2019-11-20 08:55:28,821 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 08:55:28,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=90, Invalid=215, Unknown=1, NotChecked=0, Total=306 [2019-11-20 08:55:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 08:55:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2019-11-20 08:55:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 08:55:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-11-20 08:55:28,832 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 21 [2019-11-20 08:55:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:28,833 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-11-20 08:55:28,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:55:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-11-20 08:55:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 08:55:28,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:28,834 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] [2019-11-20 08:55:29,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 08:55:29,035 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2019-11-20 08:55:29,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:29,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972672831] [2019-11-20 08:55:29,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:29,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:55:29,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:29,916 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:55:29,916 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:29,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:29,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:55:30,112 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:55:30,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972672831] [2019-11-20 08:55:30,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:30,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 08:55:30,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069725689] [2019-11-20 08:55:30,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:55:30,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:30,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:55:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:55:30,114 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 13 states. [2019-11-20 08:55:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:32,280 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-11-20 08:55:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 08:55:32,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-20 08:55:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:32,281 INFO L225 Difference]: With dead ends: 76 [2019-11-20 08:55:32,281 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 08:55:32,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:55:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 08:55:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-20 08:55:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 08:55:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-11-20 08:55:32,290 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 24 [2019-11-20 08:55:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:32,291 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-11-20 08:55:32,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:55:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-11-20 08:55:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 08:55:32,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:32,292 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:55:32,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 08:55:32,499 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2912589, now seen corresponding path program 1 times [2019-11-20 08:55:32,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:32,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911067816] [2019-11-20 08:55:32,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:32,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 08:55:32,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:33,173 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 08:55:33,394 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 08:55:33,405 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:55:33,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:33,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:33,415 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:55:33,608 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 08:55:33,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:33,609 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:55:33,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:67 [2019-11-20 08:55:33,841 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 08:55:34,060 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 08:55:34,324 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 08:55:34,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:55:34,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:34,528 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:55:34,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:55:34,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:34,542 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:55:34,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:34,567 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:55:34,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:36 [2019-11-20 08:55:40,566 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 08:55:40,585 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:55:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911067816] [2019-11-20 08:55:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:55:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 08:55:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615562668] [2019-11-20 08:55:40,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:55:40,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:55:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:55:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:55:40,587 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 14 states. [2019-11-20 08:55:41,457 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 08:55:41,895 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 08:55:42,441 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:55:42,999 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:55:43,598 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 08:55:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:55:43,768 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-20 08:55:43,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:55:43,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-20 08:55:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:55:43,771 INFO L225 Difference]: With dead ends: 73 [2019-11-20 08:55:43,772 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 08:55:43,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:55:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 08:55:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-20 08:55:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 08:55:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-20 08:55:43,782 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2019-11-20 08:55:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:55:43,783 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-20 08:55:43,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:55:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-20 08:55:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 08:55:43,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:55:43,785 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] [2019-11-20 08:55:43,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 08:55:43,987 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:55:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:55:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -490549731, now seen corresponding path program 1 times [2019-11-20 08:55:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:55:43,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338161314] [2019-11-20 08:55:43,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:55:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:55:45,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 08:55:45,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:55:45,354 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:55:45,375 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:55:45,376 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:55:45,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:45,381 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:55:45,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:45,420 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:55:45,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:37 [2019-11-20 08:55:46,039 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:55:46,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:55:46,600 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:55:46,605 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:55:46,605 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:55:46,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:46,609 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:55:46,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:55:46,619 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:55:46,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-20 08:55:53,404 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 08:56:20,049 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 08:56:22,487 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_16 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64))) (or (not (= (fp.div roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start_main_~x~0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) v_arrayElimCell_16))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) (_ bv1141899264 32)))) is different from true [2019-11-20 08:56:22,508 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:56:22,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338161314] [2019-11-20 08:56:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:56:22,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 08:56:22,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583749679] [2019-11-20 08:56:22,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:56:22,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:56:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:56:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=291, Unknown=6, NotChecked=34, Total=380 [2019-11-20 08:56:22,511 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 20 states. [2019-11-20 08:56:27,358 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 08:56:27,840 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 08:56:28,450 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:56:29,237 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:56:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:56:30,114 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-20 08:56:30,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:56:30,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-20 08:56:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:56:30,127 INFO L225 Difference]: With dead ends: 74 [2019-11-20 08:56:30,127 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 08:56:30,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=175, Invalid=525, Unknown=6, NotChecked=50, Total=756 [2019-11-20 08:56:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 08:56:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-20 08:56:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 08:56:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-20 08:56:30,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2019-11-20 08:56:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:56:30,137 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-20 08:56:30,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:56:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-20 08:56:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 08:56:30,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:56:30,139 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] [2019-11-20 08:56:30,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 08:56:30,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:56:30,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:56:30,341 INFO L82 PathProgramCache]: Analyzing trace with hash 70268002, now seen corresponding path program 1 times [2019-11-20 08:56:30,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:56:30,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774849331] [2019-11-20 08:56:30,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:56:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:56:31,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 08:56:31,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:56:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:56:34,180 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:56:34,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:56:34,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:56:35,018 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:56:35,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774849331] [2019-11-20 08:56:35,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:56:35,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 20 [2019-11-20 08:56:35,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884879482] [2019-11-20 08:56:35,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:56:35,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:56:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:56:35,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2019-11-20 08:56:35,021 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-20 08:56:36,576 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 08:56:39,071 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-20 08:56:43,443 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-20 08:56:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:56:43,476 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-20 08:56:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:56:43,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-20 08:56:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:56:43,493 INFO L225 Difference]: With dead ends: 48 [2019-11-20 08:56:43,493 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 08:56:43,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=199, Invalid=556, Unknown=1, NotChecked=0, Total=756 [2019-11-20 08:56:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 08:56:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-20 08:56:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 08:56:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-20 08:56:43,503 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 36 [2019-11-20 08:56:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:56:43,505 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-20 08:56:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:56:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-20 08:56:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 08:56:43,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:56:43,507 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] [2019-11-20 08:56:43,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 08:56:43,732 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:56:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:56:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1439805872, now seen corresponding path program 1 times [2019-11-20 08:56:43,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:56:43,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511501310] [2019-11-20 08:56:43,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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:56:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:56:44,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 08:56:44,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:56:45,484 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:56:45,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:56:45,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:56:45,514 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:56:45,614 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 08:56:45,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:56:45,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 08:56:45,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:94 [2019-11-20 08:56:47,285 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:56:47,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:56:47,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:56:47,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:56:48,216 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 67 treesize of output 61 [2019-11-20 08:56:48,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:56:48,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:56:48,231 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:56:48,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:56:48,261 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:56:48,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:49 [2019-11-20 08:56:50,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) is different from false [2019-11-20 08:56:55,014 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (bvsgt c_ULTIMATE.start___ieee754_atan2_~k~0 (_ bv60 32))) is different from true [2019-11-20 08:56:57,412 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (bvsgt (bvashr (bvadd (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1) c_ULTIMATE.start___ieee754_atan2_~iy~0) (_ bv20 32)) (_ bv60 32))) is different from true [2019-11-20 08:57:42,264 WARN L191 SmtUtils]: Spent 12.25 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 08:57:44,707 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (forall ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (not (= c_ULTIMATE.start___ieee754_atan2_~y (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)))) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1)) (_ bv20 32)) (_ bv60 32))))) is different from true [2019-11-20 08:58:36,011 WARN L191 SmtUtils]: Spent 7.04 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 08:58:39,089 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (bvsgt (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))) (_ bv20 32)) (_ bv60 32)) (not (= c_ULTIMATE.start___ieee754_atan2_~y (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)))) (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|)) c_ULTIMATE.start___ieee754_atan2_~x))))) is different from false [2019-11-20 08:58:41,542 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (or (bvsgt (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))) (_ bv20 32)) (_ bv60 32)) (not (= c_ULTIMATE.start___ieee754_atan2_~y (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)))) (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|)) c_ULTIMATE.start___ieee754_atan2_~x))))) is different from true [2019-11-20 08:59:39,065 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 08:59:39,083 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:59:39,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511501310] [2019-11-20 08:59:39,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:59:39,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 33 [2019-11-20 08:59:39,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052093105] [2019-11-20 08:59:39,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 08:59:39,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:59:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 08:59:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=636, Unknown=40, NotChecked=280, Total=1056 [2019-11-20 08:59:39,085 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2019-11-20 08:59:40,192 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 25 [2019-11-20 08:59:41,072 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-11-20 08:59:43,898 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= c_ULTIMATE.start___ieee754_atan2_~y (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))) (= c_ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (= (_ +zero 11 53) c_ULTIMATE.start_main_~x~0) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= c_ULTIMATE.start___ieee754_atan2_~y (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))) (= (bvashr (bvadd (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))) (_ bv20 32)) c_ULTIMATE.start___ieee754_atan2_~k~0) (= (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|)) c_ULTIMATE.start___ieee754_atan2_~x))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= c_ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (= (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|)) c_ULTIMATE.start___ieee754_atan2_~x))) (or (forall ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64))) (or (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|)) (_ bv2146435072 32))) (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|)))))) (bvsgt c_ULTIMATE.start___ieee754_atan2_~k~0 (_ bv60 32))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= c_ULTIMATE.start___ieee754_atan2_~y (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))) (= c_ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_6)))) (= (_ +zero 11 53) c_ULTIMATE.start___ieee754_atan2_~x) (fp.lt c_ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= c_ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (= (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|)) c_ULTIMATE.start___ieee754_atan2_~x)))) is different from true [2019-11-20 09:00:06,374 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-20 09:00:16,570 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 09:00:26,314 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-20 09:00:35,873 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-20 09:00:45,662 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-20 09:00:59,261 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-20 09:01:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:01:36,203 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-20 09:01:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 09:01:36,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-11-20 09:01:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:01:36,628 INFO L225 Difference]: With dead ends: 57 [2019-11-20 09:01:36,628 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 09:01:36,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 213.6s TimeCoverageRelationStatistics Valid=275, Invalid=1341, Unknown=48, NotChecked=498, Total=2162 [2019-11-20 09:01:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 09:01:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-20 09:01:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 09:01:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-11-20 09:01:36,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 42 [2019-11-20 09:01:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:01:36,640 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-11-20 09:01:36,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 09:01:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-11-20 09:01:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 09:01:36,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:01:36,642 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 09:01:36,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 09:01:36,859 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:01:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:01:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2043823236, now seen corresponding path program 1 times [2019-11-20 09:01:36,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:01:36,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504033499] [2019-11-20 09:01:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/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 09:01:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:01:38,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 09:01:38,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:01:38,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 09:01:38,878 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 0 case distinctions, treesize of input 47 treesize of output 47 [2019-11-20 09:01:38,892 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 17 treesize of output 9 [2019-11-20 09:01:38,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:01:38,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:38,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:38,912 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 25 treesize of output 13 [2019-11-20 09:01:38,913 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:01:38,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:38,916 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:01:38,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:38,936 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 09:01:38,936 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:23 [2019-11-20 09:01:39,014 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 09:01:39,014 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:01:39,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,130 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 65 treesize of output 67 [2019-11-20 09:01:39,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,170 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 55 treesize of output 70 [2019-11-20 09:01:39,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:01:39,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,209 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 40 treesize of output 24 [2019-11-20 09:01:39,210 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:01:39,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,235 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 40 treesize of output 24 [2019-11-20 09:01:39,236 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:01:39,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,247 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 09:01:39,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:01:39,265 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 09:01:39,265 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:32 [2019-11-20 09:01:39,387 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 09:01:39,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504033499] [2019-11-20 09:01:39,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:01:39,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 10 [2019-11-20 09:01:39,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937414318] [2019-11-20 09:01:39,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:01:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:01:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:01:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:01:39,389 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 10 states. [2019-11-20 09:01:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:01:39,562 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-11-20 09:01:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:01:39,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-20 09:01:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:01:39,564 INFO L225 Difference]: With dead ends: 44 [2019-11-20 09:01:39,564 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:01:39,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-20 09:01:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:01:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:01:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:01:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:01:39,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-20 09:01:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:01:39,565 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:01:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:01:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:01:39,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:01:39,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-20 09:01:39,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 09:01:44,947 WARN L191 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-20 09:01:45,097 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-11-20 09:01:51,436 WARN L191 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 136 DAG size of output: 57 [2019-11-20 09:01:51,437 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-20 09:01:51,438 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-20 09:01:51,439 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 09:01:51,440 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 09:01:51,440 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-20 09:01:51,440 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 09:01:51,440 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) .cse0)) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 .cse0))) [2019-11-20 09:01:51,440 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 09:01:51,440 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-20 09:01:51,441 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)) ~pi_lo_atan2~0) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-20 09:01:51,442 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 09:01:51,443 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)) ~pi_lo_atan2~0) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|))) (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|)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~lx~0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 .cse0)))) (= (bvor ULTIMATE.start___ieee754_atan2_~ix~1 ULTIMATE.start___ieee754_atan2_~lx~0) (_ bv0 32)) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2019-11-20 09:01:51,444 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,445 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 09:01:51,446 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)))) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse0 ~pi_lo_atan2~0) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (and (= (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)) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (= ULTIMATE.start___ieee754_atan2_~z~1 (fp.add roundNearestTiesToEven ~pi_o_2~0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32))) (and (= (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)) (= (bvor (bvand (_ bv1 32) (bvashr ULTIMATE.start___ieee754_atan2_~hy~0 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-20 09:01:51,447 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 09:01:51,448 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-20 09:01:51,448 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 09:01:51,448 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-20 09:01:51,449 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 09:01:51,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2019-11-20 09:01:51,450 INFO L447 ceAbstractionStarter]: At program point L265(lines 244 266) the Hoare annotation is: true [2019-11-20 09:01:51,450 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 09:01:51,450 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 09:01:51,450 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-20 09:01:51,461 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,462 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,463 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,472 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,474 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-20 09:01:51,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,482 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,484 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-20 09:01:51,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,491 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,493 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,494 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,494 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,497 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,497 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,508 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:01:51 BoogieIcfgContainer [2019-11-20 09:01:51,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:01:51,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:01:51,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:01:51,514 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:01:51,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:59" (3/4) ... [2019-11-20 09:01:51,518 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:01:51,537 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-20 09:01:51,538 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 09:01:51,538 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 09:01:51,567 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_43 : bv64, v_skolemized_v_prenex_19_3 : bv64 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_43[63:63], v_skolemized_q#valueAsBitvector_43[62:52], v_skolemized_q#valueAsBitvector_43[51:0]) == ~Pluszero~LONGDOUBLE() && lx == v_skolemized_v_prenex_19_3[31:0]) && v_skolemized_v_prenex_19_3[63:32] == v_skolemized_q#valueAsBitvector_43[63:32]) && hx == v_skolemized_q#valueAsBitvector_43[63:32])) && ~bvor32(ix, lx) == 0bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-11-20 09:01:51,568 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: v_skolemized_q#valueAsBitvector_31[63:32] == hx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0])) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-11-20 09:01:51,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((aux-switch (m) { case 0: return z; case 1: { __uint32_t zh; do { ieee_double_shape_type gh_u; gh_u.value = (z); (zh) = gh_u.parts.msw; } while (0); do { ieee_double_shape_type sh_u; sh_u.value = (z); sh_u.parts.msw = (zh ^ 0x80000000); (z) = sh_u.value; } while (0); } return z; case 2: return pi - (z - pi_lo_atan2); default: return (z - pi_lo_atan2) - pi; }-aux && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~Pluszero~LONGDOUBLE() && hx == v_skolemized_q#valueAsBitvector_33[63:32])) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && z == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000)))) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, ULTIMATE.start___ieee754_atan2_~hy~0 : bv32 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_33[63:32], 30bv32))) == m)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-11-20 09:01:51,634 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_67979765-863a-404b-a8f0-fa81d7cf41a8/bin/uautomizer/witness.graphml [2019-11-20 09:01:51,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:01:51,636 INFO L168 Benchmark]: Toolchain (without parser) took 449308.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -274.0 MB). Peak memory consumption was 362.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,636 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:01:51,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -201.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,637 INFO L168 Benchmark]: Boogie Preprocessor took 86.20 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 09:01:51,638 INFO L168 Benchmark]: RCFGBuilder took 36092.66 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,638 INFO L168 Benchmark]: TraceAbstraction took 412358.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 196.9 MB). Peak memory consumption was 308.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,638 INFO L168 Benchmark]: Witness Printer took 121.02 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -43.0 MB). Free memory was 887.2 MB in the beginning and 1.2 GB in the end (delta: -348.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:01:51,640 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.55 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 562.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -201.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.20 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. * RCFGBuilder took 36092.66 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412358.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 196.9 MB). Peak memory consumption was 308.0 MB. Max. memory is 11.5 GB. * Witness Printer took 121.02 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -43.0 MB). Free memory was 887.2 MB in the beginning and 1.2 GB in the end (delta: -348.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: 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 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-11-20 09:01:51,659 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && ~Pluszero~LONGDOUBLE() == x) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant [2019-11-20 09:01:51,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-20 09:01:51,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,669 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,671 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-20 09:01:51,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-20 09:01:51,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((((aux-switch (m) { case 0: return z; case 1: { __uint32_t zh; do { ieee_double_shape_type gh_u; gh_u.value = (z); (zh) = gh_u.parts.msw; } while (0); do { ieee_double_shape_type sh_u; sh_u.value = (z); sh_u.parts.msw = (zh ^ 0x80000000); (z) = sh_u.value; } while (0); } return z; case 2: return pi - (z - pi_lo_atan2); default: return (z - pi_lo_atan2) - pi; }-aux && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~Pluszero~LONGDOUBLE() && hx == v_skolemized_q#valueAsBitvector_33[63:32])) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && z == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000)))) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, ULTIMATE.start___ieee754_atan2_~hy~0 : bv32 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_33[63:32], 30bv32))) == m)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-11-20 09:01:51,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,681 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,682 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-20 09:01:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_43,QUANTIFIED] [2019-11-20 09:01:51,684 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,684 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_43 : bv64, v_skolemized_v_prenex_19_3 : bv64 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_43[63:63], v_skolemized_q#valueAsBitvector_43[62:52], v_skolemized_q#valueAsBitvector_43[51:0]) == ~Pluszero~LONGDOUBLE() && lx == v_skolemized_v_prenex_19_3[31:0]) && v_skolemized_v_prenex_19_3[63:32] == v_skolemized_q#valueAsBitvector_43[63:32]) && hx == v_skolemized_q#valueAsBitvector_43[63:32])) && ~bvor32(ix, lx) == 0bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 142]: Loop Invariant [2019-11-20 09:01:51,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 09:01:51,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 09:01:51,694 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:01:51,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: v_skolemized_q#valueAsBitvector_31[63:32] == hx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0])) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: SAFE, OverallTime: 412.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 156.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, HoareTripleCheckerStatistics: 679 SDtfs, 2488 SDslu, 2280 SDs, 0 SdLazy, 658 SolverSat, 65 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 84.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 417 SyntacticMatches, 7 SemanticMatches, 197 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 289.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 23 NumberOfFragments, 329 HoareAnnotationTreeSize, 17 FomulaSimplifications, 460 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 529 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 233.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 560 ConstructedInterpolants, 209 QuantifiedInterpolants, 327592 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1839 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...