./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P --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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:45:56,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:45:56,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:45:56,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:45:56,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:45:56,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:45:56,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:45:56,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:45:56,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:45:56,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:45:56,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:45:56,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:45:56,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:45:56,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:45:56,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:45:56,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:45:56,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:45:56,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:45:56,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:45:56,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:45:56,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:45:56,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:45:56,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:45:56,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:45:56,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:45:56,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:45:56,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:45:56,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:45:56,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:45:56,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:45:56,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:45:56,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:45:56,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:45:56,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:45:56,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:45:56,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:45:56,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:45:56,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:45:56,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:45:56,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:45:56,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:45:56,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:45:56,665 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:45:56,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:45:56,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:45:56,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:45:56,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:45:56,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:45:56,668 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:45:56,668 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:45:56,669 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:45:56,669 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:45:56,670 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:45:56,671 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:45:56,671 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:45:56,671 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:45:56,671 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:45:56,672 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:45:56,672 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:45:56,672 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:45:56,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:45:56,673 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:45:56,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:45:56,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:45:56,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:45:56,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:45:56,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:45:56,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:45:56,677 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:45:56,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:45:56,678 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:45:56,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:45:56,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:45:56,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:45:56,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:45:56,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:45:56,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:45:56,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:45:56,680 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:45:56,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:45:56,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:45:56,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:45:56,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:45:56,682 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_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/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_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-11-21 01:45:56,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:45:56,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:45:56,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:45:56,993 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:45:56,994 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:45:56,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-11-21 01:45:57,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/6d76fd0b2/3697ade01eb24b37a517677f6bae1a71/FLAG3860a5fda [2021-11-21 01:45:57,538 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:45:57,539 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-11-21 01:45:57,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/6d76fd0b2/3697ade01eb24b37a517677f6bae1a71/FLAG3860a5fda [2021-11-21 01:45:57,911 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/6d76fd0b2/3697ade01eb24b37a517677f6bae1a71 [2021-11-21 01:45:57,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:45:57,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:45:57,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:45:57,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:45:57,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:45:57,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:57" (1/1) ... [2021-11-21 01:45:57,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0286bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:57, skipping insertion in model container [2021-11-21 01:45:57,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:57" (1/1) ... [2021-11-21 01:45:57,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:45:57,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:45:58,133 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_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-11-21 01:45:58,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:45:58,164 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:45:58,178 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_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-11-21 01:45:58,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:45:58,199 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:45:58,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58 WrapperNode [2021-11-21 01:45:58,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:45:58,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:45:58,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:45:58,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:45:58,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,236 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-11-21 01:45:58,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:45:58,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:45:58,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:45:58,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:45:58,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:45:58,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:45:58,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:45:58,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:45:58,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (1/1) ... [2021-11-21 01:45:58,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:45:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:45:58,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:45:58,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:45:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:45:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:45:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:45:58,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:45:58,426 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:45:58,428 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:45:58,558 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:45:58,609 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:45:58,610 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 01:45:58,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:58 BoogieIcfgContainer [2021-11-21 01:45:58,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:45:58,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:45:58,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:45:58,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:45:58,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:45:57" (1/3) ... [2021-11-21 01:45:58,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280780e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:58, skipping insertion in model container [2021-11-21 01:45:58,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:58" (2/3) ... [2021-11-21 01:45:58,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280780e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:58, skipping insertion in model container [2021-11-21 01:45:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:58" (3/3) ... [2021-11-21 01:45:58,634 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-11-21 01:45:58,644 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:45:58,645 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:45:58,708 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:45:58,715 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-21 01:45:58,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:45:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-21 01:45:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 01:45:58,743 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:45:58,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 01:45:58,744 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:45:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:45:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 80052486, now seen corresponding path program 1 times [2021-11-21 01:45:58,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:45:58,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990908176] [2021-11-21 01:45:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:45:58,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:45:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:45:58,920 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-21 01:45:58,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:45:58,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990908176] [2021-11-21 01:45:58,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990908176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:45:58,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:45:58,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:45:58,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890651908] [2021-11-21 01:45:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:45:58,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:45:58,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:45:58,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:45:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:45:58,962 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-21 01:45:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:45:59,001 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-11-21 01:45:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:45:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-11-21 01:45:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:45:59,012 INFO L225 Difference]: With dead ends: 15 [2021-11-21 01:45:59,012 INFO L226 Difference]: Without dead ends: 7 [2021-11-21 01:45:59,015 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-21 01:45:59,019 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:45:59,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:45:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-11-21 01:45:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-21 01:45:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-21 01:45:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-11-21 01:45:59,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-11-21 01:45:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:45:59,051 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-11-21 01:45:59,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-21 01:45:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-11-21 01:45:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:45:59,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:45:59,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:45:59,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:45:59,054 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:45:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:45:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1807980756, now seen corresponding path program 1 times [2021-11-21 01:45:59,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:45:59,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677762609] [2021-11-21 01:45:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:45:59,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:45:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:45:59,136 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 01:45:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:45:59,197 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 01:45:59,198 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 01:45:59,199 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:45:59,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:45:59,206 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-21 01:45:59,209 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:45:59,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:45:59 BoogieIcfgContainer [2021-11-21 01:45:59,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:45:59,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:45:59,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:45:59,232 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:45:59,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:58" (3/4) ... [2021-11-21 01:45:59,236 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 01:45:59,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:45:59,237 INFO L158 Benchmark]: Toolchain (without parser) took 1321.31ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.2MB in the beginning and 76.7MB in the end (delta: -15.5MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2021-11-21 01:45:59,238 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:45:59,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.61ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 70.3MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:45:59,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.78ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:45:59,240 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:45:59,240 INFO L158 Benchmark]: RCFGBuilder took 351.87ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 57.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:45:59,241 INFO L158 Benchmark]: TraceAbstraction took 616.80ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 56.7MB in the beginning and 76.7MB in the end (delta: -19.9MB). Peak memory consumption was 61.5kB. Max. memory is 16.1GB. [2021-11-21 01:45:59,242 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:45:59,245 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.32ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.61ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 70.3MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.78ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.87ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 57.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 616.80ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 56.7MB in the beginning and 76.7MB in the end (delta: -19.9MB). Peak memory consumption was 61.5kB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. 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: 12]: 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 49, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L14] float pi = 3.14159 ; [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, term=49, x=49] [L30] COND TRUE 1 [L32] term = term * (x/count) [L33] EXPR (count>>1 % 2 == 0) ? 1 : -1 [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=49] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, 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, 6 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 6 mSDtfsCounter, 3 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=9occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 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-21 01:45:59,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/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_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P --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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:46:01,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:46:01,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:46:01,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:46:01,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:46:01,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:46:01,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:46:01,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:46:01,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:46:01,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:46:01,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:46:01,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:46:01,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:46:01,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:46:01,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:46:01,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:46:01,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:46:01,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:46:01,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:46:01,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:46:01,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:46:01,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:46:01,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:46:01,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:46:01,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:46:01,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:46:01,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:46:01,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:46:01,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:46:01,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:46:01,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:46:01,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:46:01,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:46:01,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:46:01,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:46:01,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:46:01,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:46:01,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:46:01,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:46:01,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:46:01,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:46:01,976 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 01:46:02,003 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:46:02,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:46:02,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:46:02,004 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:46:02,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:46:02,005 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:46:02,005 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:46:02,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:46:02,006 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:46:02,006 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:46:02,006 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:46:02,007 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:46:02,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:46:02,008 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:46:02,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:46:02,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:46:02,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:46:02,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:46:02,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:46:02,009 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:46:02,009 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:46:02,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:46:02,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:46:02,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:46:02,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:46:02,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:46:02,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:46:02,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:46:02,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:46:02,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:46:02,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:46:02,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:46:02,012 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:46:02,013 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:46:02,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:46:02,013 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:46:02,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:46:02,014 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_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/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_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-11-21 01:46:02,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:46:02,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:46:02,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:46:02,429 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:46:02,430 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:46:02,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-11-21 01:46:02,525 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/abff0b674/f5bd9d0cf5a049778473e4ee7253dfa8/FLAG09a6b9281 [2021-11-21 01:46:03,128 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:46:03,130 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-11-21 01:46:03,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/abff0b674/f5bd9d0cf5a049778473e4ee7253dfa8/FLAG09a6b9281 [2021-11-21 01:46:03,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/data/abff0b674/f5bd9d0cf5a049778473e4ee7253dfa8 [2021-11-21 01:46:03,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:46:03,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:46:03,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:46:03,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:46:03,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:46:03,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c604c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03, skipping insertion in model container [2021-11-21 01:46:03,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:46:03,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:46:03,608 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_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-11-21 01:46:03,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:46:03,640 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:46:03,653 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_b304826f-5fb8-4865-9674-4c405ca6d34c/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-11-21 01:46:03,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:46:03,675 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:46:03,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03 WrapperNode [2021-11-21 01:46:03,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:46:03,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:46:03,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:46:03,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:46:03,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,714 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-11-21 01:46:03,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:46:03,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:46:03,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:46:03,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:46:03,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:46:03,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:46:03,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:46:03,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:46:03,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (1/1) ... [2021-11-21 01:46:03,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:46:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:46:03,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:46:03,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:46:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:46:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:46:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:46:03,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:46:03,937 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:46:03,939 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:46:09,376 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:46:09,383 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:46:09,384 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 01:46:09,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:46:09 BoogieIcfgContainer [2021-11-21 01:46:09,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:46:09,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:46:09,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:46:09,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:46:09,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:46:03" (1/3) ... [2021-11-21 01:46:09,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc7cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:46:09, skipping insertion in model container [2021-11-21 01:46:09,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:03" (2/3) ... [2021-11-21 01:46:09,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc7cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:46:09, skipping insertion in model container [2021-11-21 01:46:09,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:46:09" (3/3) ... [2021-11-21 01:46:09,397 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-11-21 01:46:09,404 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:46:09,405 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:46:09,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:46:09,478 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-21 01:46:09,478 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:46:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-21 01:46:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 01:46:09,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:46:09,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:46:09,503 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:46:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:46:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-11-21 01:46:09,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:46:09,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943621607] [2021-11-21 01:46:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:46:09,527 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:46:09,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:46:09,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:46:09,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:46:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:46:09,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 01:46:09,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:46:09,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-21 01:46:09,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:46:09,832 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-21 01:46:09,833 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:46:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943621607] [2021-11-21 01:46:09,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943621607] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:46:09,836 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:46:09,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:46:09,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207902951] [2021-11-21 01:46:09,840 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:46:09,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:46:09,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:46:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:46:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:46:09,901 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 01:46:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:46:09,921 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-21 01:46:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:46:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2021-11-21 01:46:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:46:09,936 INFO L225 Difference]: With dead ends: 29 [2021-11-21 01:46:09,937 INFO L226 Difference]: Without dead ends: 12 [2021-11-21 01:46:09,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-21 01:46:09,950 INFO L933 BasicCegarLoop]: 17 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, 17 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-21 01:46:09,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:46:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-21 01:46:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-21 01:46:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-21 01:46:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-21 01:46:09,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-11-21 01:46:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:46:09,982 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-21 01:46:09,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 01:46:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-21 01:46:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 01:46:09,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:46:09,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:46:10,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:46:10,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:46:10,197 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:46:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:46:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-11-21 01:46:10,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:46:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064256556] [2021-11-21 01:46:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:46:10,200 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:46:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:46:10,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:46:10,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:46:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:46:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:46:11,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:46:11,127 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-21 01:46:11,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:46:11,224 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-21 01:46:11,225 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:46:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064256556] [2021-11-21 01:46:11,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064256556] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:46:11,225 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:46:11,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:46:11,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849024258] [2021-11-21 01:46:11,226 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:46:11,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:46:11,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:46:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:46:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:46:11,229 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-21 01:46:13,892 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:46:16,144 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:46:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:46:16,232 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-11-21 01:46:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:46:16,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11 [2021-11-21 01:46:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:46:16,234 INFO L225 Difference]: With dead ends: 24 [2021-11-21 01:46:16,234 INFO L226 Difference]: Without dead ends: 16 [2021-11-21 01:46:16,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:46:16,235 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:46:16,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2021-11-21 01:46:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-21 01:46:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-21 01:46:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-21 01:46:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-21 01:46:16,239 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-11-21 01:46:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:46:16,239 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-21 01:46:16,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-21 01:46:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-21 01:46:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 01:46:16,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:46:16,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:46:16,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-21 01:46:16,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:46:16,442 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:46:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:46:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-11-21 01:46:16,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:46:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162963793] [2021-11-21 01:46:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:46:16,444 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:46:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:46:16,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:46:16,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:46:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:46:19,257 WARN L261 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-21 01:46:19,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:47:20,849 WARN L227 SmtUtils]: Spent 15.45s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:48:02,226 WARN L227 SmtUtils]: Spent 16.33s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:48:21,688 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2021-11-21 01:48:23,771 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2021-11-21 01:49:40,430 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)))))) (or (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-11-21 01:49:42,502 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)))))) (or (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-11-21 01:49:58,366 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-11-21 01:50:00,438 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-11-21 01:50:00,439 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-21 01:50:00,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:50:14,773 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-11-21 01:50:16,855 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-11-21 01:50:23,054 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-11-21 01:50:25,119 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-11-21 01:50:31,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from false [2021-11-21 01:50:33,596 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from true [2021-11-21 01:50:39,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from false [2021-11-21 01:50:42,019 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from true [2021-11-21 01:50:52,796 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))))) is different from false [2021-11-21 01:50:54,903 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))))) is different from true [2021-11-21 01:51:11,656 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))))) is different from true [2021-11-21 01:51:11,657 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-21 01:51:11,657 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:51:11,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162963793] [2021-11-21 01:51:11,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162963793] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:51:11,658 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:51:11,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-21 01:51:11,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045836155] [2021-11-21 01:51:11,658 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:51:11,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-21 01:51:11,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:51:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-21 01:51:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=67, Unknown=17, NotChecked=216, Total=342 [2021-11-21 01:51:11,661 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-21 01:51:13,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2021-11-21 01:51:15,943 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true [2021-11-21 01:51:18,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2))))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse4 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (or (not .cse3) (not .cse4)) .cse0) (and .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-21 01:51:20,240 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2))))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse4 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (or (not .cse3) (not .cse4)) .cse0) (and .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:51:22,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from false [2021-11-21 01:51:24,725 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from true [2021-11-21 01:51:26,911 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from false [2021-11-21 01:51:29,093 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from true [2021-11-21 01:51:31,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from false [2021-11-21 01:51:33,411 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from true [2021-11-21 01:51:35,597 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)))) is different from false [2021-11-21 01:51:37,756 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)))) is different from true [2021-11-21 01:51:39,874 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) (fp.geq |c_ULTIMATE.start_main_~oddExp~0#1| |c_ULTIMATE.start_main_~evenExp~0#1|)) is different from false [2021-11-21 01:51:41,999 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)))))) (or (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0))))) is different from false [2021-11-21 01:51:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:51:42,020 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-21 01:51:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 01:51:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 11 [2021-11-21 01:51:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:51:42,022 INFO L225 Difference]: With dead ends: 20 [2021-11-21 01:51:42,022 INFO L226 Difference]: Without dead ends: 16 [2021-11-21 01:51:42,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 139.5s TimeCoverageRelationStatistics Valid=58, Invalid=69, Unknown=31, NotChecked=544, Total=702 [2021-11-21 01:51:42,027 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:51:42,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2021-11-21 01:51:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-21 01:51:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-21 01:51:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-21 01:51:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-21 01:51:42,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-11-21 01:51:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:51:42,034 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-21 01:51:42,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-21 01:51:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-21 01:51:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:51:42,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:51:42,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:51:42,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:51:42,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:51:42,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:51:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:51:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-11-21 01:51:42,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:51:42,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676237505] [2021-11-21 01:51:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:51:42,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:51:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:51:42,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:51:42,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:51:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:51:43,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:51:43,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:51:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:43,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:51:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:44,225 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:51:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676237505] [2021-11-21 01:51:44,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676237505] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:51:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37887217] [2021-11-21 01:51:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:51:44,226 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:51:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:51:44,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:51:44,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-21 01:51:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:51:44,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:51:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:51:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:44,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:51:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:44,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [37887217] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:51:44,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587980460] [2021-11-21 01:51:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:51:44,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:51:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:51:44,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:51:44,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 01:51:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:51:46,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:51:46,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:51:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:46,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:51:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:51:46,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587980460] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:51:46,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:51:46,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2021-11-21 01:51:46,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516297258] [2021-11-21 01:51:46,768 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:51:46,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:51:46,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:51:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:51:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:51:46,770 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-21 01:51:48,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:51:50,581 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:51:52,858 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:51:55,068 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-21 01:51:57,334 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:51:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:51:57,441 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-21 01:51:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:51:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 15 [2021-11-21 01:51:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:51:57,443 INFO L225 Difference]: With dead ends: 35 [2021-11-21 01:51:57,443 INFO L226 Difference]: Without dead ends: 27 [2021-11-21 01:51:57,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:51:57,445 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2021-11-21 01:51:57,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 10.7s Time] [2021-11-21 01:51:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-21 01:51:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-11-21 01:51:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-21 01:51:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-11-21 01:51:57,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-11-21 01:51:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:51:57,453 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-11-21 01:51:57,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-21 01:51:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-11-21 01:51:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:51:57,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:51:57,455 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:51:57,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:51:57,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:51:57,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:51:58,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:51:58,069 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:51:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:51:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-11-21 01:51:58,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:51:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420401149] [2021-11-21 01:51:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:51:58,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:51:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:51:58,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:51:58,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b304826f-5fb8-4865-9674-4c405ca6d34c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-21 01:53:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:53:48,252 WARN L261 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-21 01:53:48,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:54:47,319 WARN L227 SmtUtils]: Spent 18.07s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:55:34,546 WARN L227 SmtUtils]: Spent 17.61s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:56:09,616 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse1) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse0))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|))) is different from false [2021-11-21 01:57:18,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 .cse1))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-11-21 01:57:58,964 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 .cse1))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-11-21 01:58:20,164 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from false [2021-11-21 01:58:22,270 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from true [2021-11-21 01:59:41,315 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse4)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-11-21 01:59:43,417 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse4)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-11-21 02:00:01,181 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2021-11-21 02:00:03,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2021-11-21 02:00:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-21 02:00:03,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:00:18,027 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-11-21 02:00:20,108 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-11-21 02:00:26,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-11-21 02:00:28,371 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-11-21 02:00:34,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from false