./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:01:06,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:01:06,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:01:06,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:01:06,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:01:06,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:01:06,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:01:06,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:01:06,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:01:06,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:01:06,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:01:06,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:01:06,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:01:06,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:01:06,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:01:06,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:01:06,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:01:06,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:01:06,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:01:06,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:01:06,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:01:06,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:01:06,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:01:06,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:01:06,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:01:06,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:01:06,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:01:06,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:01:06,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:01:06,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:01:06,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:01:06,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:01:06,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:01:06,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:01:06,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:01:06,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:01:06,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:01:06,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:01:06,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:01:06,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:01:06,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:01:06,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:01:06,659 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:01:06,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:01:06,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:01:06,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:01:06,661 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:01:06,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:01:06,668 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:01:06,668 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:01:06,668 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:01:06,668 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:01:06,670 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:01:06,670 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:01:06,670 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:01:06,670 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:01:06,671 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:01:06,671 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:01:06,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:01:06,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:01:06,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:01:06,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:01:06,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:01:06,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:01:06,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:01:06,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:01:06,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:01:06,673 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:01:06,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:01:06,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:01:06,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:01:06,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:01:06,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:01:06,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:06,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:01:06,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:01:06,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:01:06,678 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:01:06,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:01:06,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:01:06,678 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:01:06,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:01:06,679 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2021-11-19 14:01:06,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:01:06,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:01:06,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:01:06,972 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:01:06,973 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:01:06,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-11-19 14:01:07,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/02acd1cc1/dfc73917b1ce410ca69ce9325c26bf79/FLAGf5c708e60 [2021-11-19 14:01:07,522 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:01:07,524 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-11-19 14:01:07,534 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/02acd1cc1/dfc73917b1ce410ca69ce9325c26bf79/FLAGf5c708e60 [2021-11-19 14:01:08,024 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/02acd1cc1/dfc73917b1ce410ca69ce9325c26bf79 [2021-11-19 14:01:08,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:01:08,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:01:08,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:08,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:01:08,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:01:08,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cb1041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08, skipping insertion in model container [2021-11-19 14:01:08,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:01:08,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:01:08,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-11-19 14:01:08,357 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:08,382 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:01:08,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-11-19 14:01:08,472 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:08,493 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:01:08,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08 WrapperNode [2021-11-19 14:01:08,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:08,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:08,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:01:08,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:01:08,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,586 INFO L137 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 235 [2021-11-19 14:01:08,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:08,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:01:08,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:01:08,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:01:08,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:01:08,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:01:08,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:01:08,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:01:08,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (1/1) ... [2021-11-19 14:01:08,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:08,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:01:08,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:01:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:01:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:01:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:01:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-19 14:01:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 14:01:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-11-19 14:01:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2021-11-19 14:01:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2021-11-19 14:01:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:01:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:01:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 14:01:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-19 14:01:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2021-11-19 14:01:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2021-11-19 14:01:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:01:08,936 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:01:08,938 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:01:09,442 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:01:09,523 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:01:09,524 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-11-19 14:01:09,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:09 BoogieIcfgContainer [2021-11-19 14:01:09,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:01:09,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:01:09,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:01:09,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:01:09,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:01:08" (1/3) ... [2021-11-19 14:01:09,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3848530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:09, skipping insertion in model container [2021-11-19 14:01:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:08" (2/3) ... [2021-11-19 14:01:09,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3848530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:09, skipping insertion in model container [2021-11-19 14:01:09,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:09" (3/3) ... [2021-11-19 14:01:09,544 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2021-11-19 14:01:09,549 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:01:09,549 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:01:09,602 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:01:09,617 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 14:01:09,617 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:01:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:01:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-19 14:01:09,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:09,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:09,674 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1749894934, now seen corresponding path program 1 times [2021-11-19 14:01:09,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:09,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404921109] [2021-11-19 14:01:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:09,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:10,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:10,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404921109] [2021-11-19 14:01:10,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404921109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:10,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:10,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 14:01:10,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160773507] [2021-11-19 14:01:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:10,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:01:10,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:01:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:01:10,072 INFO L87 Difference]: Start difference. First operand has 72 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:10,172 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2021-11-19 14:01:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:01:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-19 14:01:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:10,189 INFO L225 Difference]: With dead ends: 143 [2021-11-19 14:01:10,189 INFO L226 Difference]: Without dead ends: 69 [2021-11-19 14:01:10,195 INFO L932 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 [2021-11-19 14:01:10,200 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:10,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:01:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-19 14:01:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-19 14:01:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:01:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2021-11-19 14:01:10,273 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 12 [2021-11-19 14:01:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:10,274 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2021-11-19 14:01:10,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2021-11-19 14:01:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 14:01:10,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:10,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:10,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:01:10,279 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1002918344, now seen corresponding path program 1 times [2021-11-19 14:01:10,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:10,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021065944] [2021-11-19 14:01:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:10,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:01:10,435 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:01:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:01:10,588 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:01:10,588 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:01:10,593 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:01:10,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:01:10,601 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-19 14:01:10,604 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:01:10,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:01:10 BoogieIcfgContainer [2021-11-19 14:01:10,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:01:10,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:01:10,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:01:10,661 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:01:10,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:09" (3/4) ... [2021-11-19 14:01:10,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:01:10,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:01:10,666 INFO L158 Benchmark]: Toolchain (without parser) took 2636.58ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 47.0MB in the beginning and 60.1MB in the end (delta: -13.1MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2021-11-19 14:01:10,666 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:10,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.96ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 46.9MB in the beginning and 83.4MB in the end (delta: -36.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:01:10,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.53ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 81.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:01:10,669 INFO L158 Benchmark]: Boogie Preprocessor took 99.09ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 78.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 14:01:10,669 INFO L158 Benchmark]: RCFGBuilder took 835.93ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 53.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-19 14:01:10,670 INFO L158 Benchmark]: TraceAbstraction took 1131.06ms. Allocated memory is still 111.1MB. Free memory was 52.7MB in the beginning and 60.6MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:10,671 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 111.1MB. Free memory was 60.6MB in the beginning and 60.1MB in the end (delta: 490.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:10,675 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.96ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 46.9MB in the beginning and 83.4MB in the end (delta: -36.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.53ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 81.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.09ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 78.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 835.93ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 53.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1131.06ms. Allocated memory is still 111.1MB. Free memory was 52.7MB in the beginning and 60.6MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 111.1MB. Free memory was 60.6MB in the beginning and 60.1MB in the end (delta: 490.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 245]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 244, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; [L236] float x = __VERIFIER_nondet_float(); [L237] float y = -1.0f / 0.0f; [L239] CALL isfinite_float(x) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000002, aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L221] ieee_float_shape_type gf_u; [L222] gf_u.value = (x) [L223] EXPR gf_u.word [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); [L239] RET isfinite_float(x) [L239] COND TRUE isfinite_float(x) [L241] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000003, aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000003, aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, hx=-1, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000003, aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, hx=-1, hy=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000003, aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, hx=-1, hy=0, ix=2139095041, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] [L241] RET, EXPR __ieee754_atan2f(y, x) [L241] float res = __ieee754_atan2f(y, x); [L244] COND TRUE res != -pi_o_2 VAL [aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] [L245] reach_error() VAL [aT_atan={9:0}, atanhi_atan={6:0}, atanlo_atan={7:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000003, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 86 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, 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=72occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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, ACCELERATED_INTERPOLATION: 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 [2021-11-19 14:01:10,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:01:13,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:01:13,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:01:13,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:01:13,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:01:13,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:01:13,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:01:13,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:01:13,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:01:13,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:01:13,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:01:13,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:01:13,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:01:13,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:01:13,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:01:13,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:01:13,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:01:13,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:01:13,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:01:13,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:01:13,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:01:13,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:01:13,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:01:13,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:01:13,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:01:13,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:01:13,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:01:13,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:01:13,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:01:13,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:01:13,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:01:13,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:01:13,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:01:13,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:01:13,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:01:13,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:01:13,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:01:13,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:01:13,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:01:13,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:01:13,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:01:13,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:01:13,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:01:13,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:01:13,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:01:13,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:01:13,580 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:01:13,580 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:01:13,580 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:01:13,580 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:01:13,581 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:01:13,581 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:01:13,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:01:13,584 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:01:13,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:01:13,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:01:13,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:01:13,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:01:13,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:01:13,585 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:01:13,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:01:13,586 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:01:13,586 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:01:13,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:01:13,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:01:13,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:01:13,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:01:13,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:01:13,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:01:13,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:13,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:01:13,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:01:13,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:01:13,589 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:01:13,589 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:01:13,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:01:13,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:01:13,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:01:13,590 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2021-11-19 14:01:14,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:01:14,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:01:14,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:01:14,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:01:14,088 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:01:14,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-11-19 14:01:14,166 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/5dd79f350/5371a057f7b04c359d448d1124b4d75f/FLAG9c1a6432a [2021-11-19 14:01:14,816 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:01:14,818 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-11-19 14:01:14,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/5dd79f350/5371a057f7b04c359d448d1124b4d75f/FLAG9c1a6432a [2021-11-19 14:01:15,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/data/5dd79f350/5371a057f7b04c359d448d1124b4d75f [2021-11-19 14:01:15,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:01:15,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:01:15,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:15,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:01:15,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:01:15,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435f14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15, skipping insertion in model container [2021-11-19 14:01:15,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:01:15,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:01:15,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-11-19 14:01:15,417 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:15,451 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:01:15,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-11-19 14:01:15,510 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:15,533 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:01:15,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15 WrapperNode [2021-11-19 14:01:15,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:15,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:15,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:01:15,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:01:15,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,623 INFO L137 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 235 [2021-11-19 14:01:15,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:15,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:01:15,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:01:15,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:01:15,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:01:15,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:01:15,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:01:15,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:01:15,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (1/1) ... [2021-11-19 14:01:15,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:15,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:01:15,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:01:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:01:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-19 14:01:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:01:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:01:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-19 14:01:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2021-11-19 14:01:15,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2021-11-19 14:01:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-19 14:01:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:01:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:01:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-11-19 14:01:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2021-11-19 14:01:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2021-11-19 14:01:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-19 14:01:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:01:15,943 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:01:15,945 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:01:26,770 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:01:26,779 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:01:26,780 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-11-19 14:01:26,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:26 BoogieIcfgContainer [2021-11-19 14:01:26,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:01:26,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:01:26,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:01:26,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:01:26,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:01:15" (1/3) ... [2021-11-19 14:01:26,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede45ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:26, skipping insertion in model container [2021-11-19 14:01:26,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:15" (2/3) ... [2021-11-19 14:01:26,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede45ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:26, skipping insertion in model container [2021-11-19 14:01:26,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:26" (3/3) ... [2021-11-19 14:01:26,794 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2021-11-19 14:01:26,801 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:01:26,802 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:01:26,862 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:01:26,870 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 14:01:26,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:01:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:01:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 14:01:26,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:26,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:26,900 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2021-11-19 14:01:26,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:26,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161118385] [2021-11-19 14:01:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:26,922 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:26,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:26,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:26,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:01:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:28,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 14:01:28,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:28,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:28,396 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:28,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161118385] [2021-11-19 14:01:28,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161118385] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:28,397 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:28,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 14:01:28,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916576692] [2021-11-19 14:01:28,401 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:28,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:01:28,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:01:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:01:28,454 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:28,512 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2021-11-19 14:01:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:01:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-19 14:01:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:28,548 INFO L225 Difference]: With dead ends: 190 [2021-11-19 14:01:28,548 INFO L226 Difference]: Without dead ends: 92 [2021-11-19 14:01:28,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:01:28,557 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:28,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:01:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-19 14:01:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-19 14:01:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:01:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2021-11-19 14:01:28,616 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2021-11-19 14:01:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:28,616 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2021-11-19 14:01:28,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2021-11-19 14:01:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-19 14:01:28,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:28,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:28,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-19 14:01:28,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:28,836 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2021-11-19 14:01:28,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:28,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704653530] [2021-11-19 14:01:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:28,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:28,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:28,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:28,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:01:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 14:01:30,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:30,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-11-19 14:01:32,019 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 14:01:32,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 42 [2021-11-19 14:01:32,960 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 14:01:32,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2021-11-19 14:01:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:34,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:39,776 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:39,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704653530] [2021-11-19 14:01:39,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704653530] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:39,776 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:39,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2021-11-19 14:01:39,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759782574] [2021-11-19 14:01:39,777 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:39,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:01:39,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:01:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-11-19 14:01:39,780 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:39,855 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2021-11-19 14:01:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 14:01:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-19 14:01:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:39,858 INFO L225 Difference]: With dead ends: 96 [2021-11-19 14:01:39,858 INFO L226 Difference]: Without dead ends: 92 [2021-11-19 14:01:39,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-11-19 14:01:39,861 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:39,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1596 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2021-11-19 14:01:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-19 14:01:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-19 14:01:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:01:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2021-11-19 14:01:39,877 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 17 [2021-11-19 14:01:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:39,878 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2021-11-19 14:01:39,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2021-11-19 14:01:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 14:01:39,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:39,880 INFO L514 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] [2021-11-19 14:01:39,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-19 14:01:40,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:40,096 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1450439137, now seen corresponding path program 1 times [2021-11-19 14:01:40,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:40,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099478894] [2021-11-19 14:01:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:40,098 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:40,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:40,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:01:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:41,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 14:01:41,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:43,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:46,484 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:46,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099478894] [2021-11-19 14:01:46,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099478894] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:46,485 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:46,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-19 14:01:46,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029867874] [2021-11-19 14:01:46,486 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:46,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 14:01:46,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 14:01:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:01:46,488 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:54,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:01:57,283 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:01:59,613 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:01,617 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:03,253 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:05,590 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:08,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:11,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:12,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:12,919 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2021-11-19 14:02:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:02:12,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-19 14:02:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:12,925 INFO L225 Difference]: With dead ends: 100 [2021-11-19 14:02:12,925 INFO L226 Difference]: Without dead ends: 95 [2021-11-19 14:02:12,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:02:12,928 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:12,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 462 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 25.2s Time] [2021-11-19 14:02:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-19 14:02:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-11-19 14:02:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2021-11-19 14:02:12,951 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 22 [2021-11-19 14:02:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:12,952 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2021-11-19 14:02:12,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2021-11-19 14:02:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 14:02:12,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:12,954 INFO L514 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] [2021-11-19 14:02:12,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:13,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:13,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1452286179, now seen corresponding path program 1 times [2021-11-19 14:02:13,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:13,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243706375] [2021-11-19 14:02:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:13,162 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:13,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:13,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 14:02:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:14,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 14:02:14,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:14,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:15,789 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:15,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243706375] [2021-11-19 14:02:15,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243706375] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:15,790 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:15,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-19 14:02:15,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395350320] [2021-11-19 14:02:15,790 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:15,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 14:02:15,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 14:02:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 14:02:15,792 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:15,805 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2021-11-19 14:02:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 14:02:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-19 14:02:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:15,808 INFO L225 Difference]: With dead ends: 100 [2021-11-19 14:02:15,808 INFO L226 Difference]: Without dead ends: 94 [2021-11-19 14:02:15,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 14:02:15,818 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 61 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:15,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 699 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2021-11-19 14:02:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-19 14:02:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2021-11-19 14:02:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2021-11-19 14:02:15,829 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 22 [2021-11-19 14:02:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:15,830 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2021-11-19 14:02:15,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2021-11-19 14:02:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 14:02:15,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:15,831 INFO L514 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] [2021-11-19 14:02:15,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:16,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:16,032 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -947623069, now seen corresponding path program 1 times [2021-11-19 14:02:16,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:16,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227093291] [2021-11-19 14:02:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:16,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:16,034 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:16,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 14:02:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:17,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-19 14:02:17,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:17,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:19,105 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:19,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227093291] [2021-11-19 14:02:19,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227093291] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:19,106 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:19,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-19 14:02:19,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445772150] [2021-11-19 14:02:19,107 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:19,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 14:02:19,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 14:02:19,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:02:19,109 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:19,184 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2021-11-19 14:02:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:02:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-19 14:02:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:19,188 INFO L225 Difference]: With dead ends: 177 [2021-11-19 14:02:19,189 INFO L226 Difference]: Without dead ends: 105 [2021-11-19 14:02:19,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:02:19,191 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 38 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:19,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 911 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2021-11-19 14:02:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-19 14:02:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-11-19 14:02:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2021-11-19 14:02:19,205 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 22 [2021-11-19 14:02:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:19,206 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2021-11-19 14:02:19,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2021-11-19 14:02:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 14:02:19,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:19,208 INFO L514 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] [2021-11-19 14:02:19,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:19,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:19,424 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1672952196, now seen corresponding path program 1 times [2021-11-19 14:02:19,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:19,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036508899] [2021-11-19 14:02:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:19,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:19,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:19,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-19 14:02:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:20,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-19 14:02:20,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:20,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-11-19 14:02:21,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2021-11-19 14:02:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:23,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:25,212 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:25,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036508899] [2021-11-19 14:02:25,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036508899] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:25,213 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:25,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-11-19 14:02:25,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6567832] [2021-11-19 14:02:25,213 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:25,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-19 14:02:25,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:25,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-19 14:02:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-19 14:02:25,215 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:25,445 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2021-11-19 14:02:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 14:02:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-19 14:02:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:25,447 INFO L225 Difference]: With dead ends: 137 [2021-11-19 14:02:25,448 INFO L226 Difference]: Without dead ends: 73 [2021-11-19 14:02:25,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-19 14:02:25,450 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:25,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 880 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2021-11-19 14:02:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-19 14:02:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-19 14:02:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2021-11-19 14:02:25,463 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 23 [2021-11-19 14:02:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:25,464 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2021-11-19 14:02:25,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2021-11-19 14:02:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 14:02:25,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:25,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:02:25,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:25,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:25,692 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash 791814228, now seen corresponding path program 1 times [2021-11-19 14:02:25,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:25,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410429087] [2021-11-19 14:02:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:25,694 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:25,698 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:25,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-19 14:02:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:26,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 14:02:26,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:29,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:33,827 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:33,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410429087] [2021-11-19 14:02:33,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410429087] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:33,828 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:33,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-19 14:02:33,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383818492] [2021-11-19 14:02:33,829 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:33,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 14:02:33,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:33,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 14:02:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:02:33,831 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:37,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:42,043 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:44,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:46,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:48,148 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:50,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:51,895 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:54,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:56,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:02:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:56,389 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2021-11-19 14:02:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:02:56,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-19 14:02:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:56,392 INFO L225 Difference]: With dead ends: 81 [2021-11-19 14:02:56,392 INFO L226 Difference]: Without dead ends: 76 [2021-11-19 14:02:56,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:02:56,394 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 128 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:56,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 268 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 20.9s Time] [2021-11-19 14:02:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-19 14:02:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-11-19 14:02:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2021-11-19 14:02:56,405 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 24 [2021-11-19 14:02:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:56,406 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2021-11-19 14:02:56,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2021-11-19 14:02:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 14:02:56,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:56,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:02:56,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-19 14:02:56,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:56,616 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 793661270, now seen corresponding path program 1 times [2021-11-19 14:02:56,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:56,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804007766] [2021-11-19 14:02:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:56,618 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:56,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:56,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-19 14:02:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:57,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 14:02:57,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:58,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:59,227 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:59,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804007766] [2021-11-19 14:02:59,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804007766] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:59,228 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:59,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-19 14:02:59,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729554153] [2021-11-19 14:02:59,228 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:59,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 14:02:59,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:59,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 14:02:59,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 14:02:59,230 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:59,238 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2021-11-19 14:02:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 14:02:59,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-19 14:02:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:59,241 INFO L225 Difference]: With dead ends: 92 [2021-11-19 14:02:59,241 INFO L226 Difference]: Without dead ends: 86 [2021-11-19 14:02:59,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 14:02:59,243 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:59,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 326 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2021-11-19 14:02:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-19 14:02:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2021-11-19 14:02:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 14:02:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2021-11-19 14:02:59,254 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 24 [2021-11-19 14:02:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:59,254 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2021-11-19 14:02:59,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2021-11-19 14:02:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:02:59,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:59,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:02:59,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:59,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:59,475 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:02:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1553945203, now seen corresponding path program 1 times [2021-11-19 14:02:59,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:59,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747074463] [2021-11-19 14:02:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:59,495 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:59,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:59,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-19 14:03:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:00,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-19 14:03:00,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:01,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:02,870 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:03:02,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747074463] [2021-11-19 14:03:02,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747074463] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:03:02,870 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:03:02,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-19 14:03:02,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373668503] [2021-11-19 14:03:02,870 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:02,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 14:03:02,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:03:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 14:03:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:03:02,872 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:02,967 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2021-11-19 14:03:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:03:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-19 14:03:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:02,969 INFO L225 Difference]: With dead ends: 105 [2021-11-19 14:03:02,969 INFO L226 Difference]: Without dead ends: 51 [2021-11-19 14:03:02,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:03:02,971 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:02,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2021-11-19 14:03:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-19 14:03:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-19 14:03:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2021-11-19 14:03:02,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2021-11-19 14:03:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:02,979 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2021-11-19 14:03:02,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2021-11-19 14:03:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:03:02,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:02,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:03:03,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-19 14:03:03,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:03:03,200 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:03:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:03,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1512113405, now seen corresponding path program 1 times [2021-11-19 14:03:03,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:03:03,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418719979] [2021-11-19 14:03:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:03:03,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:03:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:03:03,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:03:03,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-19 14:03:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:04,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:03:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:05,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:07,758 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:03:07,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418719979] [2021-11-19 14:03:07,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418719979] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:03:07,758 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:03:07,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-19 14:03:07,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421809243] [2021-11-19 14:03:07,758 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:07,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:03:07,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:03:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:03:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:03:07,760 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:10,513 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:12,754 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:14,838 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:17,011 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:19,157 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:21,324 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:23,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:23,494 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-11-19 14:03:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 14:03:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-11-19 14:03:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:23,545 INFO L225 Difference]: With dead ends: 58 [2021-11-19 14:03:23,545 INFO L226 Difference]: Without dead ends: 51 [2021-11-19 14:03:23,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-11-19 14:03:23,547 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:23,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 440 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 7 Unknown, 59 Unchecked, 15.5s Time] [2021-11-19 14:03:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-19 14:03:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-19 14:03:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-11-19 14:03:23,555 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 28 [2021-11-19 14:03:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:23,556 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-11-19 14:03:23,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-11-19 14:03:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-19 14:03:23,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:23,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:03:23,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:23,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:03:23,784 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:03:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 868682631, now seen corresponding path program 1 times [2021-11-19 14:03:23,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:03:23,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498491291] [2021-11-19 14:03:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:03:23,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:03:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:03:23,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:03:23,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-19 14:03:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:24,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 14:03:24,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:25,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:27,679 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:03:27,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498491291] [2021-11-19 14:03:27,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498491291] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:03:27,680 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:03:27,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-11-19 14:03:27,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59867951] [2021-11-19 14:03:27,680 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:27,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 14:03:27,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:03:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 14:03:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-19 14:03:27,681 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:30,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:33,179 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:35,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:37,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:40,212 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:42,051 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:03:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:42,052 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-11-19 14:03:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:03:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-11-19 14:03:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:42,105 INFO L225 Difference]: With dead ends: 61 [2021-11-19 14:03:42,105 INFO L226 Difference]: Without dead ends: 54 [2021-11-19 14:03:42,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:03:42,106 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:42,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 348 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 5 Unknown, 38 Unchecked, 14.0s Time] [2021-11-19 14:03:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-19 14:03:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2021-11-19 14:03:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2021-11-19 14:03:42,113 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 29 [2021-11-19 14:03:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:42,114 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2021-11-19 14:03:42,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:03:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2021-11-19 14:03:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-19 14:03:42,115 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:42,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:03:42,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:42,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:03:42,330 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:03:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1756186312, now seen corresponding path program 1 times [2021-11-19 14:03:42,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:03:42,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652461430] [2021-11-19 14:03:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:03:42,331 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:03:42,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:03:42,332 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:03:42,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-19 14:03:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:44,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:03:44,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:44,770 INFO L354 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2021-11-19 14:03:44,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 68 [2021-11-19 14:03:45,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:45,979 INFO L354 Elim1Store]: treesize reduction 84, result has 22.2 percent of original size [2021-11-19 14:03:45,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 136 [2021-11-19 14:03:46,396 INFO L354 Elim1Store]: treesize reduction 73, result has 25.5 percent of original size [2021-11-19 14:03:46,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 157 treesize of output 172 [2021-11-19 14:03:49,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:49,927 INFO L354 Elim1Store]: treesize reduction 84, result has 22.2 percent of original size [2021-11-19 14:03:49,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 173 [2021-11-19 14:03:50,523 INFO L354 Elim1Store]: treesize reduction 116, result has 22.1 percent of original size [2021-11-19 14:03:50,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 194 treesize of output 215 [2021-11-19 14:03:52,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:52,691 INFO L354 Elim1Store]: treesize reduction 84, result has 22.2 percent of original size [2021-11-19 14:03:52,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 207 treesize of output 175 [2021-11-19 14:03:53,216 INFO L354 Elim1Store]: treesize reduction 116, result has 22.1 percent of original size [2021-11-19 14:03:53,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 196 treesize of output 217 [2021-11-19 14:03:56,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:56,395 INFO L354 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2021-11-19 14:03:56,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 120 [2021-11-19 14:03:56,701 INFO L354 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2021-11-19 14:03:56,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 124 [2021-11-19 14:04:07,126 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-11-19 14:04:07,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 290 treesize of output 198 [2021-11-19 14:04:07,507 INFO L354 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2021-11-19 14:04:07,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 186 [2021-11-19 14:04:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:04:11,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:04:18,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (or (fp.eq (let ((.cse1 (store |c_#memory_int| |v_atan_float_~#gf_u~1.base_26| (store (select |c_#memory_int| |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (select (select .cse1 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse2 (select (select .cse1 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_atan_float_~#gf_u~1.base_26|)))))) is different from false [2021-11-19 14:04:20,750 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq |c_atan_float_#res| (fp.neg c_~pi_o_2~0)) (exists ((|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (and (not (fp.eq (let ((.cse1 (store |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26| (store (select |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (select (select .cse1 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse2 (select (select .cse1 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.neg c_~pi_o_2~0))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_atan_float_~#gf_u~1.base_26|))))))) is different from true [2021-11-19 14:04:24,795 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (select (select |c_#memory_int| |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse1 (select (select |c_#memory_int| |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (fp.neg c_~pi_o_2~0)) (exists ((|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (and (not (fp.eq (let ((.cse3 (store |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26| (store (select |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse2 (select (select .cse3 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (let ((.cse4 (select (select .cse3 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.neg c_~pi_o_2~0))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_atan_float_~#gf_u~1.base_26|))))))) is different from true [2021-11-19 14:04:33,664 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_atan_float_~#gf_u~1.base_20| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 32))) (or (fp.eq (let ((.cse1 (store |c_#memory_int| |v_atan_float_~#gf_u~1.base_20| (store (select |c_#memory_int| |v_atan_float_~#gf_u~1.base_20|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_35|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (select (select .cse1 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse2 (select (select .cse1 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_atan_float_~#gf_u~1.base_20|)))))) (exists ((|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (and (not (fp.eq (let ((.cse4 (store |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26| (store (select |c_old(#memory_int)| |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse3 (select (select .cse4 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (let ((.cse5 (select (select .cse4 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.neg c_~pi_o_2~0))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_atan_float_~#gf_u~1.base_26|))))))) is different from true [2021-11-19 14:04:38,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ BitVec 32)) (|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ bv0 1)) |v_atan_float_~#gf_u~1.base_26|)))))) (fp.eq (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (store (select |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_34|)))) (store .cse3 |v_atan_float_~#gf_u~1.base_26| (store (select .cse3 |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (select (select .cse1 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse2 (select (select .cse1 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|))))) is different from false [2021-11-19 14:04:44,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 32)) (|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ bv0 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ bv0 1)) |v_atan_float_~#gf_u~1.base_26|))))))) (fp.eq (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (store (select |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_33|)))) (store .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (store (select .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_34|))))) (store .cse4 |v_atan_float_~#gf_u~1.base_26| (store (select .cse4 |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse1 (select (select .cse2 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (let ((.cse3 (select (select .cse2 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.neg c_~pi_o_2~0))))) is different from false [2021-11-19 14:05:03,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 32)) (|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ bv0 1)))) (let ((.cse7 (store .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ bv0 1)))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (fp.eq (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (store (select |c_#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_32|)))) (store .cse6 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (store (select .cse6 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_33|))))) (store .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (store (select .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_34|))))) (store .cse4 |v_atan_float_~#gf_u~1.base_26| (store (select .cse4 |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse1 (select (select .cse2 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (let ((.cse3 (select (select .cse2 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse7 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ bv0 1)) |v_atan_float_~#gf_u~1.base_26|)))))))) (not (= (_ bv0 1) (bvneg (select .cse7 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|)))))))) is different from false [2021-11-19 14:05:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:05:10,585 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:05:10,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652461430] [2021-11-19 14:05:10,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652461430] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:05:10,585 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:05:10,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 19 [2021-11-19 14:05:10,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119335220] [2021-11-19 14:05:10,586 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:05:10,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:05:10,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:05:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:05:10,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=134, Unknown=8, NotChecked=196, Total=380 [2021-11-19 14:05:10,588 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:05:13,042 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#atanhi_atan~0.base|))) (and (forall ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 32)) (|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (_ bv0 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store .cse0 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ bv0 1)) |v_atan_float_~#gf_u~1.base_26|))))))) (fp.eq (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28| (store (select |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_28|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_33|)))) (store .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (store (select .cse5 |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_34|))))) (store .cse4 |v_atan_float_~#gf_u~1.base_26| (store (select .cse4 |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse1 (select (select .cse2 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (let ((.cse3 (select (select .cse2 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.neg c_~pi_o_2~0))))) (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse6 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_~#atanlo_atan~0.base|)) .cse6)) (= (_ bv0 1) (bvadd .cse6 (_ bv1 1)))))) (not (= |c_~#atanlo_atan~0.base| |c_~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse7 (select (select |c_#memory_int| |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= |c_~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= c_~pi_o_2~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse8 (select .cse9 (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse10 (select .cse9 |c_~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse11 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse11)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |~#aT_atan~0.base|)) .cse11)) (not (= |c_~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse12 (select (select |c_#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse13 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse13 (select |c_#valid| |c_~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse13) (_ bv1 1)))))))) is different from false [2021-11-19 14:05:15,210 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#atanhi_atan~0.base|))) (and (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |c_~#atanlo_atan~0.base| |c_~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |c_#memory_int| |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (forall ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ BitVec 32)) (|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (_ bv0 1)) |v_atan_float_~#gf_u~1.base_26|)))))) (fp.eq (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31| (store (select |c_#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_34|)))) (store .cse5 |v_atan_float_~#gf_u~1.base_26| (store (select .cse5 |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse2 (select (select .cse3 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (let ((.cse4 (select (select .cse3 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~3#1.base_31|))))) (= |c_~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= c_~pi_o_2~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse6 (select .cse7 (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse8 (select .cse7 |c_~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse9 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse9)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |~#aT_atan~0.base|)) .cse9)) (not (= |c_~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse10 (select (select |c_#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse11 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse11 (select |c_#valid| |c_~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse11) (_ bv1 1)))))))) is different from false [2021-11-19 14:05:17,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#atanhi_atan~0.base|))) (and (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |c_~#atanlo_atan~0.base| |c_~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |c_#memory_int| |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_~#atanhi_atan~0.offset| (_ bv0 32)) (forall ((|v_atan_float_~#gf_u~1.base_26| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (or (fp.eq (let ((.cse3 (store |c_#memory_int| |v_atan_float_~#gf_u~1.base_26| (store (select |c_#memory_int| |v_atan_float_~#gf_u~1.base_26|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_38|)))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse2 (select (select .cse3 |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (let ((.cse4 (select (select .cse3 |c_~#atanlo_atan~0.base|) (bvadd |c_~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.neg c_~pi_o_2~0)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_atan_float_~#gf_u~1.base_26|)))))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= c_~pi_o_2~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse5 (select .cse6 (bvadd |c_~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse7 (select .cse6 |c_~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse8 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse8)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |~#aT_atan~0.base|)) .cse8)) (not (= |c_~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse9 (select (select |c_#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse10 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse10 (select |c_#valid| |c_~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse10) (_ bv1 1)))))))) is different from false [2021-11-19 14:05:41,733 WARN L227 SmtUtils]: Spent 12.42s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:06:02,847 WARN L227 SmtUtils]: Spent 14.84s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:06:04,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:06:07,028 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:06:09,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:06:12,292 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:06:14,017 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:06:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:14,018 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-11-19 14:06:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:06:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-11-19 14:06:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:14,082 INFO L225 Difference]: With dead ends: 60 [2021-11-19 14:06:14,082 INFO L226 Difference]: Without dead ends: 51 [2021-11-19 14:06:14,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 78.5s TimeCoverageRelationStatistics Valid=56, Invalid=180, Unknown=14, NotChecked=350, Total=600 [2021-11-19 14:06:14,084 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:14,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 284 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 265 Unchecked, 11.3s Time] [2021-11-19 14:06:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-19 14:06:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-11-19 14:06:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-11-19 14:06:14,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 29 [2021-11-19 14:06:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:14,095 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-11-19 14:06:14,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-11-19 14:06:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-19 14:06:14,097 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:14,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:06:14,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:14,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:14,303 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:06:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1197063290, now seen corresponding path program 1 times [2021-11-19 14:06:14,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:06:14,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517071710] [2021-11-19 14:06:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:06:14,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:06:14,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:06:14,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:06:14,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-19 14:06:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:06:15,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:06:15,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:16,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:19,972 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:06:19,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517071710] [2021-11-19 14:06:19,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517071710] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:06:19,973 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:06:19,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-19 14:06:19,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779245140] [2021-11-19 14:06:19,973 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:19,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:06:19,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:06:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:06:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:06:19,975 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:20,198 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-11-19 14:06:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:06:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-11-19 14:06:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:20,200 INFO L225 Difference]: With dead ends: 59 [2021-11-19 14:06:20,200 INFO L226 Difference]: Without dead ends: 52 [2021-11-19 14:06:20,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:06:20,203 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:20,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 332 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2021-11-19 14:06:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-19 14:06:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-19 14:06:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-11-19 14:06:20,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2021-11-19 14:06:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:20,217 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-11-19 14:06:20,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-11-19 14:06:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-19 14:06:20,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:20,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:06:20,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:20,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:20,436 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:06:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -959503187, now seen corresponding path program 1 times [2021-11-19 14:06:20,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:06:20,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571874688] [2021-11-19 14:06:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:06:20,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:06:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:06:20,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:06:20,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-19 14:06:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:06:23,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:06:23,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:24,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:28,112 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:06:28,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571874688] [2021-11-19 14:06:28,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571874688] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:06:28,112 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:06:28,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-19 14:06:28,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207835046] [2021-11-19 14:06:28,113 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:28,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:06:28,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:06:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:06:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:06:28,115 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:28,424 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2021-11-19 14:06:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:06:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-11-19 14:06:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:28,427 INFO L225 Difference]: With dead ends: 60 [2021-11-19 14:06:28,427 INFO L226 Difference]: Without dead ends: 46 [2021-11-19 14:06:28,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:06:28,429 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:28,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 341 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-11-19 14:06:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-19 14:06:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-11-19 14:06:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-11-19 14:06:28,439 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2021-11-19 14:06:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:28,440 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-11-19 14:06:28,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-11-19 14:06:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-19 14:06:28,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:28,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:06:28,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:28,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:28,656 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:06:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1144895001, now seen corresponding path program 1 times [2021-11-19 14:06:28,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:06:28,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118797581] [2021-11-19 14:06:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:06:28,657 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:06:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:06:28,659 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:06:28,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-19 14:06:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:06:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:06:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:33,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:37,231 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:06:37,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118797581] [2021-11-19 14:06:37,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118797581] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:06:37,232 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:06:37,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-19 14:06:37,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196992770] [2021-11-19 14:06:37,232 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:37,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:06:37,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:06:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:06:37,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:06:37,234 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 14:06:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:38,044 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2021-11-19 14:06:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 14:06:38,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2021-11-19 14:06:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:38,046 INFO L225 Difference]: With dead ends: 63 [2021-11-19 14:06:38,046 INFO L226 Difference]: Without dead ends: 52 [2021-11-19 14:06:38,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-11-19 14:06:38,047 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:38,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 295 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 48 Unchecked, 0.0s Time] [2021-11-19 14:06:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-19 14:06:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-11-19 14:06:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:06:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-11-19 14:06:38,057 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 42 [2021-11-19 14:06:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:38,058 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-11-19 14:06:38,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 14:06:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-11-19 14:06:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-19 14:06:38,060 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:38,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:06:38,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:38,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:38,279 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:06:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1824953371, now seen corresponding path program 1 times [2021-11-19 14:06:38,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:06:38,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593730551] [2021-11-19 14:06:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:06:38,281 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:06:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:06:38,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:06:38,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-19 14:06:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:06:41,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:06:41,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:42,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:45,856 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:06:45,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593730551] [2021-11-19 14:06:45,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593730551] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:06:45,857 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:06:45,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-19 14:06:45,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11412977] [2021-11-19 14:06:45,857 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:45,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:06:45,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:06:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:06:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 14:06:45,859 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 14:06:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:46,489 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-11-19 14:06:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:06:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2021-11-19 14:06:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:46,490 INFO L225 Difference]: With dead ends: 46 [2021-11-19 14:06:46,490 INFO L226 Difference]: Without dead ends: 0 [2021-11-19 14:06:46,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-11-19 14:06:46,492 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:46,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 294 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2021-11-19 14:06:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-19 14:06:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-19 14:06:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:06:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-19 14:06:46,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2021-11-19 14:06:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:46,495 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-19 14:06:46,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 14:06:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-19 14:06:46,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-19 14:06:46,499 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:06:46,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:46,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:46,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-19 14:07:14,855 WARN L227 SmtUtils]: Spent 23.48s on a formula simplification. DAG size of input: 198 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-19 14:07:48,642 WARN L227 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 179 DAG size of output: 151 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-19 14:07:51,108 INFO L858 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2021-11-19 14:07:51,108 INFO L858 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2021-11-19 14:07:51,109 INFO L861 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2021-11-19 14:07:51,109 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2021-11-19 14:07:51,109 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2021-11-19 14:07:51,109 INFO L858 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2021-11-19 14:07:51,109 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2021-11-19 14:07:51,109 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2021-11-19 14:07:51,109 INFO L861 garLoopResultBuilder]: At program point L250(lines 229 251) the Hoare annotation is: true [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L854 garLoopResultBuilder]: At program point L120(lines 120 215) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= currentRoundingMode roundNearestTiesToEven) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000.0)))) |ULTIMATE.start___ieee754_atan2f_#res#1|)) [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2021-11-19 14:07:51,110 INFO L858 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2021-11-19 14:07:51,111 INFO L858 garLoopResultBuilder]: For program point L220-1(lines 220 224) no Hoare annotation was computed. [2021-11-19 14:07:51,111 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2021-11-19 14:07:51,111 INFO L854 garLoopResultBuilder]: At program point L220-2(lines 220 224) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (exists ((|~#aT_atan~0.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |~#aT_atan~0.base|)))))) (_ bv1 1))) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse0 (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 33333334327.0 100000000000.0)))))) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#atanlo_atan~0.base|))) (_ bv1 1))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse2 (select .cse3 (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse4 (select .cse3 |~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= currentRoundingMode roundNearestTiesToEven) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#atanhi_atan~0.base|))) (_ bv1 1))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))) [2021-11-19 14:07:51,111 INFO L858 garLoopResultBuilder]: For program point L220-3(lines 220 224) no Hoare annotation was computed. [2021-11-19 14:07:51,111 INFO L858 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L854 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hx~1#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_4) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse2 (select .cse3 (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse4 (select .cse3 |~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse5 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse5)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#aT_atan~0.base|)) .cse5)) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse6 (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse7 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse7 (select |#valid| |~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse7) (_ bv1 1)))))))) [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2021-11-19 14:07:51,112 INFO L858 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 248) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 239 248) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2021-11-19 14:07:51,113 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L854 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5|) (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_atan2f_~x#1| (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (bvslt (bvand (_ bv2147483647 32) .cse2) (_ bv2139095040 32))))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse3 (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse5 (select .cse4 |~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse6 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse6)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#aT_atan~0.base|)) .cse6)) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse7 (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse8 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse8 (select |#valid| |~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse8) (_ bv1 1)))))))) [2021-11-19 14:07:51,114 INFO L858 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L858 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L858 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2021-11-19 14:07:51,114 INFO L854 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2021-11-19 14:07:51,115 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2021-11-19 14:07:51,115 INFO L854 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2021-11-19 14:07:51,115 INFO L858 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2021-11-19 14:07:51,115 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2021-11-19 14:07:51,116 INFO L854 garLoopResultBuilder]: At program point L226(lines 218 227) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14|) (_ bv0 32)))) (and (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse3 (bvslt (bvand (_ bv2147483647 32) .cse2) (_ bv2139095040 32)))) (or (and .cse3 (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (not .cse3) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)))))))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse4 (select .cse5 (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse6 (select .cse5 |~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse7 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse7)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#aT_atan~0.base|)) .cse7)) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse8 (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse9 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse9 (select |#valid| |~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse9) (_ bv1 1)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))) [2021-11-19 14:07:51,116 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2021-11-19 14:07:51,116 INFO L858 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2021-11-19 14:07:51,116 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-19 14:07:51,116 INFO L858 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2021-11-19 14:07:51,117 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-11-19 14:07:51,117 INFO L858 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2021-11-19 14:07:51,117 INFO L858 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2021-11-19 14:07:51,117 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2021-11-19 14:07:51,117 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 247) no Hoare annotation was computed. [2021-11-19 14:07:51,118 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-11-19 14:07:51,118 INFO L858 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2021-11-19 14:07:51,118 INFO L858 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2021-11-19 14:07:51,118 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2021-11-19 14:07:51,118 INFO L858 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2021-11-19 14:07:51,119 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2021-11-19 14:07:51,119 INFO L854 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((v_arrayElimCell_12 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_12)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#atanlo_atan~0.base|)) .cse0)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1)))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) (.cse3 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) .cse2) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (bvslt (bvand (_ bv2147483647 32) .cse3) (_ bv2139095040 32))))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27| (_ BitVec 32))) (= (_ bv0 1) (select |#valid| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27|))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse4 (select .cse5 (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 46364760399.0 100000000000.0))) (let ((.cse6 (select .cse5 |~#atanhi_atan~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_14 (_ BitVec 1)) (|~#aT_atan~0.base| (_ BitVec 32))) (let ((.cse7 (bvneg (bvneg v_arrayElimCell_14)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg .cse7)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |~#aT_atan~0.base|)) .cse7)) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (= (let ((.cse8 (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 33333334327.0 100000000000.0))))))) (exists ((v_arrayElimCell_11 (_ BitVec 1))) (let ((.cse9 (bvneg v_arrayElimCell_11))) (and (= (_ bv0 1) (bvadd .cse9 (select |#valid| |~#atanhi_atan~0.base|))) (= (_ bv0 1) (bvadd (bvneg .cse9) (_ bv1 1)))))))) [2021-11-19 14:07:51,119 INFO L858 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2021-11-19 14:07:51,120 INFO L858 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2021-11-19 14:07:51,120 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2021-11-19 14:07:51,120 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-19 14:07:51,120 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-11-19 14:07:51,120 INFO L858 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2021-11-19 14:07:51,121 INFO L854 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2021-11-19 14:07:51,121 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2021-11-19 14:07:51,121 INFO L858 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2021-11-19 14:07:51,121 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2021-11-19 14:07:51,122 INFO L854 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: (or (not (= |~#atanhi_atan~0.offset| (_ bv0 32))) (and (= |old(#valid)| |#valid|) (= |old(#memory_int)| |#memory_int|)) (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))))) [2021-11-19 14:07:51,122 INFO L858 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2021-11-19 14:07:51,122 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2021-11-19 14:07:51,122 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2021-11-19 14:07:51,122 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: (or (not (= |~#atanhi_atan~0.offset| (_ bv0 32))) (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (and (= |old(#valid)| |#valid|) (= |atan_float_#in~x| atan_float_~x) (= |old(#memory_int)| |#memory_int|)) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))))) [2021-11-19 14:07:51,123 INFO L858 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2021-11-19 14:07:51,123 INFO L854 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (or (not (= |~#atanhi_atan~0.offset| (_ bv0 32))) (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (and (exists ((|v_atan_float_~#gf_u~1.base_20| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_atan_float_~#gf_u~1.base_20|))))))) (= (store |old(#memory_int)| |v_atan_float_~#gf_u~1.base_20| (store (select |old(#memory_int)| |v_atan_float_~#gf_u~1.base_20|) (_ bv0 32) |v_skolemized_q#valueAsBitvector_35|)) |#memory_int|))) (exists ((atan_float_~hx~0 (_ BitVec 32))) (and (not (bvsge (bvand (_ bv2147483647 32) atan_float_~hx~0) (_ bv1350565888 32))) (= |atan_float_#in~x| (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0))))) (= |atan_float_#in~x| atan_float_~x) (= |atan_float_#in~x| (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0)))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))))) [2021-11-19 14:07:51,123 INFO L858 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2021-11-19 14:07:51,123 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2021-11-19 14:07:51,124 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2021-11-19 14:07:51,124 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2021-11-19 14:07:51,124 INFO L858 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2021-11-19 14:07:51,124 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2021-11-19 14:07:51,124 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2021-11-19 14:07:51,125 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2021-11-19 14:07:51,126 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2021-11-19 14:07:51,130 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:07:51,132 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:07:51,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,167 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,167 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,167 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,175 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,194 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,194 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,194 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,194 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,195 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:07:51 BoogieIcfgContainer [2021-11-19 14:07:51,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:07:51,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:07:51,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:07:51,227 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:07:51,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:26" (3/4) ... [2021-11-19 14:07:51,231 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-19 14:07:51,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2021-11-19 14:07:51,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2021-11-19 14:07:51,251 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2021-11-19 14:07:51,252 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-19 14:07:51,253 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-19 14:07:51,254 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-19 14:07:51,284 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\exists ~#aT_atan~0.base : bv32 :: (0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(~bvneg32(\valid[~#aT_atan~0.base]))))), 1bv1) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000))) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(\valid[atanlo_atan])), 1bv1)) && atanhi_atan == 0bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(\valid[atanhi_atan])), 1bv1)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2021-11-19 14:07:51,284 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][22:0]) && ((~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32]), 2139095040bv32) && \result == 1bv32) || (!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32]), 2139095040bv32) && \result == 0bv32)))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2021-11-19 14:07:51,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][22:0]) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32]), 2139095040bv32))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1)) [2021-11-19 14:07:51,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5 : bv32 :: (~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][22:0])) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32]), 2139095040bv32))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1)) [2021-11-19 14:07:51,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result [2021-11-19 14:07:51,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(atanhi_atan == 0bv32) || atanlo_atan == atanhi_atan) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || ((\old(\valid) == \valid && \old(x) == x) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) [2021-11-19 14:07:51,332 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/witness.graphml [2021-11-19 14:07:51,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:07:51,333 INFO L158 Benchmark]: Toolchain (without parser) took 396214.82ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 52.4MB in the beginning and 28.0MB in the end (delta: 24.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,333 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:07:51,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.54ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 47.8MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.25ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 45.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,335 INFO L158 Benchmark]: Boogie Preprocessor took 79.80ms. Allocated memory is still 69.2MB. Free memory was 45.2MB in the beginning and 42.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,335 INFO L158 Benchmark]: RCFGBuilder took 11078.11ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 42.4MB in the beginning and 62.7MB in the end (delta: -20.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,336 INFO L158 Benchmark]: TraceAbstraction took 384440.86ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 35.4MB in the end (delta: 26.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,336 INFO L158 Benchmark]: Witness Printer took 105.71ms. Allocated memory is still 92.3MB. Free memory was 35.4MB in the beginning and 28.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:07:51,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.54ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 47.8MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.25ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 45.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.80ms. Allocated memory is still 69.2MB. Free memory was 45.2MB in the beginning and 42.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 11078.11ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 42.4MB in the beginning and 62.7MB in the end (delta: -20.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 384440.86ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 35.4MB in the end (delta: 26.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 105.71ms. Allocated memory is still 92.3MB. Free memory was 35.4MB in the beginning and 28.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,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_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 384.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 145.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 64.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 619 SdHoareTripleChecker+Valid, 87.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 7952 SdHoareTripleChecker+Invalid, 85.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 692 IncrementalHoareTripleChecker+Unchecked, 6713 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1239 mSDtfsCounter, 343 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 650 SyntacticMatches, 18 SemanticMatches, 181 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 109.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 58 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 46 PreInvPairs, 58 NumberOfFragments, 1441 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1927 FormulaSimplificationTreeSizeReductionInter, 64.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 22.3s SatisfiabilityAnalysisTime, 147.4s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 822 ConstructedInterpolants, 465 QuantifiedInterpolants, 18928 SizeOfPredicates, 131 NumberOfNonLiveVariables, 2222 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 218]: Loop Invariant [2021-11-19 14:07:51,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,369 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,369 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,369 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,369 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,369 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14,QUANTIFIED] [2021-11-19 14:07:51,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,377 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32][22:0]) && ((~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32]), 2139095040bv32) && \result == 1bv32) || (!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_14][0bv32]), 2139095040bv32) && \result == 0bv32)))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 124]: Loop Invariant [2021-11-19 14:07:51,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,380 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,380 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,380 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,381 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,383 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,383 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,383 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,385 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,385 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,385 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,386 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,390 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,390 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,390 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,391 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,391 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] Derived loop invariant: (((((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][22:0]) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32]), 2139095040bv32))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1)) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant [2021-11-19 14:07:51,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant [2021-11-19 14:07:51,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((!(atanhi_atan == 0bv32) || atanlo_atan == atanhi_atan) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || ((\old(\valid) == \valid && \old(x) == x) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) - InvariantResult [Line: 130]: Loop Invariant [2021-11-19 14:07:51,405 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,405 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,405 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,410 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2021-11-19 14:07:51,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-11-19 14:07:51,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5,QUANTIFIED] [2021-11-19 14:07:51,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27,QUANTIFIED] [2021-11-19 14:07:51,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_14,QUANTIFIED] [2021-11-19 14:07:51,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2021-11-19 14:07:51,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] Derived loop invariant: (((((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && (\exists v_arrayElimCell_12 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(\valid[atanlo_atan]), ~bvneg32(~bvneg32(v_arrayElimCell_12))) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_12)), 1bv1))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5 : bv32 :: (~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32][22:0])) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_5][0bv32]), 2139095040bv32))) && atanhi_atan == 0bv32) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27 : bv32 :: 0bv1 == \valid[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_27])) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_arrayElimCell_14 : bv1, ~#aT_atan~0.base : bv32 :: ((0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(v_arrayElimCell_14)))), 1bv1) && 0bv1 == ~bvadd64(~bvneg32(\valid[~#aT_atan~0.base]), ~bvneg32(~bvneg32(v_arrayElimCell_14)))) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000)))) && (\exists v_arrayElimCell_11 : bv1 :: 0bv1 == ~bvadd64(~bvneg32(v_arrayElimCell_11), \valid[atanhi_atan]) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(v_arrayElimCell_11)), 1bv1)) - InvariantResult [Line: 220]: Loop Invariant [2021-11-19 14:07:51,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#aT_atan~0.base,QUANTIFIED] [2021-11-19 14:07:51,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-19 14:07:51,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-19 14:07:51,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((((((((\exists ~#aT_atan~0.base : bv32 :: (0bv1 == ~bvadd64(~bvneg32(~bvneg32(~bvneg32(~bvneg32(~bvneg32(\valid[~#aT_atan~0.base]))))), 1bv1) && !(atanlo_atan == ~#aT_atan~0.base)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][31:31], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][30:23], unknown-#memory_int-unknown[~#aT_atan~0.base][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 33333334327/100000000000))) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && !(atanlo_atan == atanhi_atan)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(\valid[atanlo_atan])), 1bv1)) && atanhi_atan == 0bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 46364760399/100000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][31:31], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][30:23], unknown-#memory_int-unknown[atanhi_atan][atanhi_atan][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 0bv1 == ~bvadd64(~bvneg32(~bvneg32(\valid[atanhi_atan])), 1bv1)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) RESULT: Ultimate proved your program to be correct! [2021-11-19 14:07:51,639 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-19 14:07:51,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f330001d-c78a-466c-a32c-179deeac8445/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE