./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0663a.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_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 3e7d0b868b35716dc1f516fc758062372899bb27 ........................................................................................................................................................................................................................................................................................................................ 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_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 3e7d0b868b35716dc1f516fc758062372899bb27 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:13:52,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:13:52,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:13:52,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:13:52,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:13:52,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:13:52,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:13:52,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:13:52,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:13:52,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:13:52,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:13:52,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:13:52,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:13:52,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:13:52,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:13:52,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:13:52,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:13:52,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:13:52,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:13:52,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:13:52,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:13:52,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:13:52,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:13:52,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:13:52,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:13:52,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:13:52,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:13:52,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:13:52,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:13:52,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:13:52,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:13:52,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:13:52,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:13:52,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:13:52,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:13:52,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:13:52,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:13:52,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:13:52,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:13:52,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:13:52,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:13:52,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:13:52,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:13:52,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:13:52,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:13:52,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:13:52,975 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:13:52,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:13:52,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:13:52,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:13:52,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:13:52,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:13:52,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:13:52,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:13:52,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:13:52,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:13:52,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:13:52,990 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:13:52,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:13:52,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:13:52,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:13:52,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:13:52,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:13:52,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:13:52,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:13:52,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:13:52,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:13:52,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:13:52,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:13:52,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:13:52,993 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_89533fec-20ac-4a5a-871e-99b9560c758e/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 -> 3e7d0b868b35716dc1f516fc758062372899bb27 [2019-11-20 04:13:53,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:13:53,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:13:53,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:13:53,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:13:53,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:13:53,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663a.c [2019-11-20 04:13:53,227 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/8418db201/e1cc6d5c085c4968be8b9afb507c304a/FLAG5382a8c95 [2019-11-20 04:13:53,636 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:13:53,638 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/sv-benchmarks/c/float-newlib/double_req_bl_0663a.c [2019-11-20 04:13:53,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/8418db201/e1cc6d5c085c4968be8b9afb507c304a/FLAG5382a8c95 [2019-11-20 04:13:53,965 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/8418db201/e1cc6d5c085c4968be8b9afb507c304a [2019-11-20 04:13:53,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:13:53,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:13:53,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:13:53,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:13:53,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:13:53,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:53" (1/1) ... [2019-11-20 04:13:53,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433f4f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:53, skipping insertion in model container [2019-11-20 04:13:53,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:53" (1/1) ... [2019-11-20 04:13:53,986 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:13:54,012 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:13:54,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:13:54,393 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:13:54,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:13:54,483 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:13:54,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54 WrapperNode [2019-11-20 04:13:54,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:13:54,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:13:54,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:13:54,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:13:54,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:13:54,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:13:54,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:13:54,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:13:54,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... [2019-11-20 04:13:54,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:13:54,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:13:54,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:13:54,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:13:54,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:13:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:13:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 04:13:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 04:13:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 04:13:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:13:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:13:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:13:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 04:13:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:13:55,556 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:13:55,556 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 04:13:55,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:55 BoogieIcfgContainer [2019-11-20 04:13:55,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:13:55,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:13:55,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:13:55,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:13:55,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:13:53" (1/3) ... [2019-11-20 04:13:55,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cc930b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:55, skipping insertion in model container [2019-11-20 04:13:55,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:54" (2/3) ... [2019-11-20 04:13:55,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cc930b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:55, skipping insertion in model container [2019-11-20 04:13:55,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:55" (3/3) ... [2019-11-20 04:13:55,565 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663a.c [2019-11-20 04:13:55,575 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:13:55,582 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:13:55,594 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:13:55,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:13:55,634 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:13:55,634 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:13:55,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:13:55,635 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:13:55,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:13:55,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:13:55,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:13:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 04:13:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 04:13:55,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:13:55,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:13:55,673 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:13:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:13:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 04:13:55,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:13:55,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926008521] [2019-11-20 04:13:55,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:13:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:55,871 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 04:13:55,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926008521] [2019-11-20 04:13:55,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:13:55,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:13:55,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014465904] [2019-11-20 04:13:55,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:13:55,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:13:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:13:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:13:55,895 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 04:13:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:13:55,925 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 04:13:55,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:13:55,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 04:13:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:13:55,938 INFO L225 Difference]: With dead ends: 227 [2019-11-20 04:13:55,939 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 04:13:55,942 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 04:13:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 04:13:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 04:13:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 04:13:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 04:13:55,985 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 04:13:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:13:55,986 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 04:13:55,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:13:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 04:13:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 04:13:55,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:13:55,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:13:55,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:13:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:13:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 04:13:55,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:13:55,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596956888] [2019-11-20 04:13:55,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:13:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:13:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:13:56,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:13:56,218 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:13:56,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:13:56 BoogieIcfgContainer [2019-11-20 04:13:56,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:13:56,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:13:56,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:13:56,266 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:13:56,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:55" (3/4) ... [2019-11-20 04:13:56,271 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 04:13:56,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:13:56,274 INFO L168 Benchmark]: Toolchain (without parser) took 2303.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:13:56,274 INFO L168 Benchmark]: CDTParser took 0.21 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 04:13:56,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:13:56,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:13:56,276 INFO L168 Benchmark]: Boogie Preprocessor took 73.25 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:13:56,277 INFO L168 Benchmark]: RCFGBuilder took 915.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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:13:56,278 INFO L168 Benchmark]: TraceAbstraction took 707.10 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:13:56,278 INFO L168 Benchmark]: Witness Printer took 5.64 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 04:13:56,281 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.21 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 513.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.25 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 915.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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 707.10 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.64 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 251, 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.6s, 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 04:13:58,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:13:58,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:13:58,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:13:58,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:13:58,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:13:58,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:13:58,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:13:58,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:13:58,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:13:58,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:13:58,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:13:58,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:13:58,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:13:58,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:13:58,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:13:58,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:13:58,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:13:58,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:13:58,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:13:58,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:13:58,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:13:58,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:13:58,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:13:58,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:13:58,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:13:58,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:13:58,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:13:58,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:13:58,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:13:58,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:13:58,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:13:58,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:13:58,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:13:58,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:13:58,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:13:58,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:13:58,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:13:58,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:13:58,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:13:58,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:13:58,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 04:13:58,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:13:58,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:13:58,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:13:58,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:13:58,518 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:13:58,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:13:58,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:13:58,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:13:58,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:13:58,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:13:58,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:13:58,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:13:58,520 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:13:58,520 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:13:58,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:13:58,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:13:58,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:13:58,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:13:58,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:13:58,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:13:58,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:13:58,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:13:58,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:13:58,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:13:58,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:13:58,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:13:58,526 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:13:58,526 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:13:58,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:13:58,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:13:58,527 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_89533fec-20ac-4a5a-871e-99b9560c758e/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 -> 3e7d0b868b35716dc1f516fc758062372899bb27 [2019-11-20 04:13:58,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:13:58,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:13:58,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:13:58,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:13:58,861 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:13:58,863 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663a.c [2019-11-20 04:13:58,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/a3b3649e2/43b7fe474de44d918f5d726042510f34/FLAGdf5081e4d [2019-11-20 04:13:59,326 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:13:59,326 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/sv-benchmarks/c/float-newlib/double_req_bl_0663a.c [2019-11-20 04:13:59,335 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/a3b3649e2/43b7fe474de44d918f5d726042510f34/FLAGdf5081e4d [2019-11-20 04:13:59,689 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/data/a3b3649e2/43b7fe474de44d918f5d726042510f34 [2019-11-20 04:13:59,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:13:59,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:13:59,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:13:59,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:13:59,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:13:59,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:59" (1/1) ... [2019-11-20 04:13:59,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bce3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:59, skipping insertion in model container [2019-11-20 04:13:59,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:59" (1/1) ... [2019-11-20 04:13:59,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:13:59,739 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:14:00,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:14:00,010 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:14:00,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:14:00,174 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:14:00,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00 WrapperNode [2019-11-20 04:14:00,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:14:00,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:14:00,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:14:00,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:14:00,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:14:00,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:14:00,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:14:00,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:14:00,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... [2019-11-20 04:14:00,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:14:00,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:14:00,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:14:00,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:14:00,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:00,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 04:14:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 04:14:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:14:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 04:14:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:14:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:14:00,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:14:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 04:14:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:14:39,168 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:14:39,168 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 04:14:39,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:14:39 BoogieIcfgContainer [2019-11-20 04:14:39,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:14:39,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:14:39,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:14:39,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:14:39,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:13:59" (1/3) ... [2019-11-20 04:14:39,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3b639f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:14:39, skipping insertion in model container [2019-11-20 04:14:39,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:14:00" (2/3) ... [2019-11-20 04:14:39,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3b639f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:14:39, skipping insertion in model container [2019-11-20 04:14:39,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:14:39" (3/3) ... [2019-11-20 04:14:39,180 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663a.c [2019-11-20 04:14:39,191 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:14:39,198 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:14:39,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:14:39,247 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:14:39,247 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:14:39,247 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:14:39,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:14:39,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:14:39,248 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:14:39,248 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:14:39,248 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:14:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 04:14:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 04:14:39,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:14:39,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:14:39,269 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:14:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:14:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 04:14:39,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:14:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694691237] [2019-11-20 04:14:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:39,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 04:14:39,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:14:39,635 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 04:14:39,636 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:14:39,639 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 04:14:39,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694691237] [2019-11-20 04:14:39,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:14:39,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 04:14:39,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042409158] [2019-11-20 04:14:39,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:14:39,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:14:39,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:14:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:14:39,665 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 04:14:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:14:39,694 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 04:14:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:14:39,696 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 04:14:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:14:39,708 INFO L225 Difference]: With dead ends: 227 [2019-11-20 04:14:39,708 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 04:14:39,711 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 04:14:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 04:14:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 04:14:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 04:14:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 04:14:39,755 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 04:14:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:14:39,755 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 04:14:39,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:14:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 04:14:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 04:14:39,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:14:39,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:14:39,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 04:14:39,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:14:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:14:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 04:14:39,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:14:39,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325860666] [2019-11-20 04:14:39,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:40,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 04:14:40,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:14:40,590 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 04:14:40,616 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 04:14:40,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:14:40,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:40,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:40,660 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 04:14:40,660 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:14:40,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:40,668 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 04:14:40,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:40,708 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 04:14:40,708 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:62, output treesize:34 [2019-11-20 04:14:41,075 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 04:14:41,079 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:14:41,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:14:41,341 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,341 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 04:14:41,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,388 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 04:14:41,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:14:41,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,449 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 04:14:41,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:14:41,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,465 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 04:14:41,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,491 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 04:14:41,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,511 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 04:14:41,511 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:14:41,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,537 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:14:41,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:14:41,589 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 04:14:41,589 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-20 04:14:41,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:14:41,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:14:42,050 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 04:14:42,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325860666] [2019-11-20 04:14:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:14:42,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 04:14:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749368923] [2019-11-20 04:14:42,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:14:42,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:14:42,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:14:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:14:42,053 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-20 04:14:42,737 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 04:14:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:14:43,996 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-20 04:14:44,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:14:44,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-20 04:14:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:14:44,389 INFO L225 Difference]: With dead ends: 167 [2019-11-20 04:14:44,389 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 04:14:44,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:14:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 04:14:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 04:14:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:14:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2019-11-20 04:14:44,404 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 13 [2019-11-20 04:14:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:14:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-11-20 04:14:44,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:14:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2019-11-20 04:14:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:14:44,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:14:44,406 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 04:14:44,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 04:14:44,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:14:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:14:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1228186055, now seen corresponding path program 1 times [2019-11-20 04:14:44,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:14:44,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706721539] [2019-11-20 04:14:44,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:44,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:14:44,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:14:45,418 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:45,650 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:45,822 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:45,834 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 04:14:45,834 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:14:47,229 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-20 04:14:47,231 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 04:14:47,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706721539] [2019-11-20 04:14:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:14:47,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 04:14:47,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998534259] [2019-11-20 04:14:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:14:47,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:14:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:14:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:14:47,234 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 10 states. [2019-11-20 04:14:47,810 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 04:14:49,209 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 04:14:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:14:50,145 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-11-20 04:14:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:14:50,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-20 04:14:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:14:50,154 INFO L225 Difference]: With dead ends: 72 [2019-11-20 04:14:50,154 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 04:14:50,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:14:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 04:14:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 04:14:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 04:14:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2019-11-20 04:14:50,173 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2019-11-20 04:14:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:14:50,174 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2019-11-20 04:14:50,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:14:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2019-11-20 04:14:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:14:50,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:14:50,175 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 04:14:50,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 04:14:50,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:14:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:14:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 50256570, now seen corresponding path program 1 times [2019-11-20 04:14:50,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:14:50,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828957076] [2019-11-20 04:14:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:50,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:14:50,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:14:50,966 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:51,266 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:51,477 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 04:14:51,481 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 04:14:51,481 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:14:53,622 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-20 04:14:53,625 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 04:14:53,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828957076] [2019-11-20 04:14:53,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:14:53,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 04:14:53,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593476371] [2019-11-20 04:14:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:14:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:14:53,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:14:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:14:53,627 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 10 states. [2019-11-20 04:14:54,123 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 04:14:54,827 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 04:14:55,160 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 04:14:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:14:56,552 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-20 04:14:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:14:56,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 04:14:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:14:56,559 INFO L225 Difference]: With dead ends: 70 [2019-11-20 04:14:56,559 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 04:14:56,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:14:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 04:14:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 04:14:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 04:14:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-20 04:14:56,569 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 20 [2019-11-20 04:14:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:14:56,569 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-20 04:14:56,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:14:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-20 04:14:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:14:56,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:14:56,571 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 04:14:56,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 04:14:56,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:14:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:14:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-20 04:14:56,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:14:56,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571389016] [2019-11-20 04:14:56,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:14:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:57,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:14:57,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:14:57,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:14:57,282 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 04:14:57,282 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:14:57,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:14:57,446 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 04:14:57,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571389016] [2019-11-20 04:14:57,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:14:57,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-20 04:14:57,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057469154] [2019-11-20 04:14:57,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 04:14:57,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:14:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 04:14:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:14:57,448 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 11 states. [2019-11-20 04:15:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:00,647 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2019-11-20 04:15:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:15:00,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-20 04:15:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:00,659 INFO L225 Difference]: With dead ends: 68 [2019-11-20 04:15:00,659 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 04:15:00,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 04:15:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 04:15:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-20 04:15:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-20 04:15:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-11-20 04:15:00,676 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 21 [2019-11-20 04:15:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:00,677 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-11-20 04:15:00,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 04:15:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-11-20 04:15:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 04:15:00,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:15:00,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:15:00,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 04:15:00,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:15:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:15:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2019-11-20 04:15:00,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:15:00,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122816972] [2019-11-20 04:15:00,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/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 04:15:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:15:01,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 04:15:01,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:15:01,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 04:15:01,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:15:01,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 04:15:01,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:15:01,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,730 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 36 treesize of output 20 [2019-11-20 04:15:01,731 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:15:01,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,778 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 32 treesize of output 16 [2019-11-20 04:15:01,778 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:15:01,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,798 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 04:15:01,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,812 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 04:15:01,812 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:28 [2019-11-20 04:15:01,896 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 04:15:01,896 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:15:01,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:01,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 54 [2019-11-20 04:15:02,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 04:15:02,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:15:02,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:02,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:02,037 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 04:15:02,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:15:02,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:02,042 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:15:02,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:15:02,071 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 04:15:02,071 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:26 [2019-11-20 04:15:04,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_19_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|))) (or (not (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) .cse0)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) c_ULTIMATE.start___ieee754_atan2_~x)) (= (bvor (bvand (_ bv2147483647 32) .cse0) ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (_ bv0 32))))) is different from false [2019-11-20 04:15:04,104 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 04:15:04,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122816972] [2019-11-20 04:15:04,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:15:04,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-20 04:15:04,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126807539] [2019-11-20 04:15:04,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 04:15:04,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:15:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 04:15:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-20 04:15:04,106 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 9 states. [2019-11-20 04:15:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:15:04,107 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-11-20 04:15:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:15:04,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-20 04:15:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:15:04,107 INFO L225 Difference]: With dead ends: 59 [2019-11-20 04:15:04,107 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:15:04,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-20 04:15:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:15:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:15:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:15:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:15:04,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-20 04:15:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:15:04,109 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:15:04,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 04:15:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:15:04,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:15:04,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 04:15:04,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:15:04,739 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-20 04:15:04,742 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-20 04:15:04,742 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-20 04:15:04,743 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-20 04:15:04,744 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-20 04:15:04,744 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 04:15:04,744 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 04:15:04,744 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-20 04:15:04,744 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 04:15:04,744 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))) (.cse1 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_atan2_#res| (fp.add roundNearestTiesToEven ~pi_o_2~0 .cse0)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (fp.gt (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_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= .cse1 ULTIMATE.start___ieee754_atan2_~x) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (fp.gt (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_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (= ~tiny_atan2~0 .cse0) (fp.gt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~x~0 .cse1))) [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-20 04:15:04,745 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: false [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-20 04:15:04,746 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:15:04,747 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: false [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 04:15:04,748 INFO L444 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,749 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 04:15:04,750 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-20 04:15:04,751 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 04:15:04,752 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-20 04:15:04,752 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 04:15:04,752 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2019-11-20 04:15:04,753 INFO L447 ceAbstractionStarter]: At program point L264(lines 244 265) the Hoare annotation is: true [2019-11-20 04:15:04,754 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 04:15:04,754 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 04:15:04,754 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-20 04:15:04,765 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,770 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,781 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,783 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:15:04 BoogieIcfgContainer [2019-11-20 04:15:04,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:15:04,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:15:04,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:15:04,787 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:15:04,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:14:39" (3/4) ... [2019-11-20 04:15:04,790 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:15:04,808 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-20 04:15:04,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 04:15:04,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 04:15:04,840 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~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())) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~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())) && hy == v_skolemized_v_prenex_22_3[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 04:15:04,907 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_89533fec-20ac-4a5a-871e-99b9560c758e/bin/uautomizer/witness.graphml [2019-11-20 04:15:04,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:15:04,908 INFO L168 Benchmark]: Toolchain (without parser) took 65214.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 955.1 MB in the beginning and 982.2 MB in the end (delta: -27.1 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,908 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:15:04,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,909 INFO L168 Benchmark]: Boogie Preprocessor took 71.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,910 INFO L168 Benchmark]: RCFGBuilder took 38841.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,910 INFO L168 Benchmark]: TraceAbstraction took 25615.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 81.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,911 INFO L168 Benchmark]: Witness Printer took 120.44 ms. Allocated memory is still 1.2 GB. Free memory was 997.8 MB in the beginning and 982.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:15:04,912 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -128.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38841.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25615.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 81.8 MB. Max. memory is 11.5 GB. * Witness Printer took 120.44 ms. Allocated memory is still 1.2 GB. Free memory was 997.8 MB in the beginning and 982.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 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 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 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_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 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 * 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 Derived loop invariant: 0 - 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: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - 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 Derived loop invariant: 0 - InvariantResult [Line: 142]: Loop Invariant [2019-11-20 04:15:04,924 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,928 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,929 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,931 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 04:15:04,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 04:15:04,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 04:15:04,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~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())) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~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())) && hy == v_skolemized_v_prenex_22_3[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: SAFE, OverallTime: 25.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 455 SDtfs, 1238 SDslu, 854 SDs, 0 SdLazy, 154 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 10.7s 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 19 NumberOfFragments, 120 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 46 QuantifiedInterpolants, 34472 SizeOfPredicates, 39 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...