./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:34:40,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:34:40,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:34:40,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:34:40,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:34:40,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:34:40,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:34:40,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:34:40,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:34:40,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:34:40,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:34:40,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:34:40,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:34:40,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:34:40,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:34:40,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:34:40,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:34:40,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:34:40,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:34:40,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:34:40,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:34:40,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:34:40,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:34:40,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:34:40,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:34:40,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:34:40,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:34:40,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:34:40,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:34:40,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:34:40,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:34:40,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:34:40,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:34:40,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:34:40,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:34:40,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:34:40,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:34:40,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:34:40,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:34:40,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:34:40,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:34:40,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:34:40,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:34:40,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:34:40,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:34:40,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:34:40,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:34:40,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:34:40,698 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:34:40,698 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:34:40,698 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:34:40,698 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:34:40,699 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:34:40,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:34:40,700 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:34:40,700 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:34:40,700 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:34:40,701 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:34:40,701 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:34:40,701 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:34:40,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:34:40,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:34:40,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:34:40,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:34:40,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:34:40,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:34:40,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:34:40,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:34:40,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:34:40,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:34:40,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:34:40,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:34:40,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:34:40,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:34:40,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:40,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:34:40,706 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:34:40,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:34:40,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:34:40,707 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:34:40,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:34:40,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:34:40,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:34:40,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-03 03:34:41,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:34:41,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:34:41,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:34:41,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:34:41,067 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:34:41,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-03 03:34:41,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/b1952d798/20daf51fd1124244acbed64787ecddff/FLAGd6ab3d9fb [2022-11-03 03:34:41,719 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:34:41,720 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-03 03:34:41,726 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/b1952d798/20daf51fd1124244acbed64787ecddff/FLAGd6ab3d9fb [2022-11-03 03:34:42,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/b1952d798/20daf51fd1124244acbed64787ecddff [2022-11-03 03:34:42,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:34:42,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:34:42,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:42,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:34:42,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:34:42,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29996522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42, skipping insertion in model container [2022-11-03 03:34:42,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:34:42,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:34:42,401 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-03 03:34:42,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:42,429 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:34:42,443 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-03 03:34:42,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:42,462 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:34:42,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42 WrapperNode [2022-11-03 03:34:42,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:42,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:42,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:34:42,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:34:42,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,503 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-03 03:34:42,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:42,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:34:42,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:34:42,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:34:42,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,537 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:34:42,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:34:42,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:34:42,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:34:42,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (1/1) ... [2022-11-03 03:34:42,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:42,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:34:42,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:34:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:34:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:34:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:34:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:34:42,697 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:34:42,699 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:34:42,834 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:34:42,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:34:42,888 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:34:42,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:42 BoogieIcfgContainer [2022-11-03 03:34:42,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:34:42,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:34:42,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:34:42,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:34:42,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:34:42" (1/3) ... [2022-11-03 03:34:42,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5176a11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:42, skipping insertion in model container [2022-11-03 03:34:42,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:42" (2/3) ... [2022-11-03 03:34:42,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5176a11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:42, skipping insertion in model container [2022-11-03 03:34:42,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:42" (3/3) ... [2022-11-03 03:34:42,905 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-03 03:34:42,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:34:42,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:34:43,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:34:43,014 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b88abfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:34:43,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:34:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2022-11-03 03:34:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 03:34:43,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:43,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 03:34:43,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1880294, now seen corresponding path program 1 times [2022-11-03 03:34:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:43,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991679056] [2022-11-03 03:34:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:34:43,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:34:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:34:43,193 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:34:43,196 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:34:43,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:34:43,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:34:43,204 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-03 03:34:43,209 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:34:43,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:34:43 BoogieIcfgContainer [2022-11-03 03:34:43,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:34:43,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:34:43,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:34:43,229 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:34:43,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:42" (3/4) ... [2022-11-03 03:34:43,233 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 03:34:43,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:34:43,235 INFO L158 Benchmark]: Toolchain (without parser) took 1135.81ms. Allocated memory is still 123.7MB. Free memory was 91.8MB in the beginning and 73.0MB in the end (delta: 18.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,236 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:34:43,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.65ms. Allocated memory is still 123.7MB. Free memory was 91.5MB in the beginning and 99.3MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.89ms. Allocated memory is still 123.7MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,239 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 123.7MB. Free memory was 97.7MB in the beginning and 96.8MB in the end (delta: 974.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:34:43,244 INFO L158 Benchmark]: RCFGBuilder took 350.63ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 87.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,245 INFO L158 Benchmark]: TraceAbstraction took 334.96ms. Allocated memory is still 123.7MB. Free memory was 86.8MB in the beginning and 73.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,246 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 123.7MB. Free memory was 73.5MB in the beginning and 73.0MB in the end (delta: 481.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:34:43,255 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.29ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.65ms. Allocated memory is still 123.7MB. Free memory was 91.5MB in the beginning and 99.3MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.89ms. Allocated memory is still 123.7MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 123.7MB. Free memory was 97.7MB in the beginning and 96.8MB in the end (delta: 974.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.63ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 87.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 334.96ms. Allocated memory is still 123.7MB. Free memory was 86.8MB in the beginning and 73.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 123.7MB. Free memory was 73.5MB in the beginning and 73.0MB in the end (delta: 481.0kB). Peak memory consumption was 2.1MB. 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: 4]: 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 14, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2022-11-03 03:34:43,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:34:45,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:34:45,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:34:45,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:34:45,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:34:45,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:34:45,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:34:45,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:34:45,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:34:45,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:34:45,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:34:45,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:34:45,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:34:45,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:34:45,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:34:45,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:34:45,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:34:45,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:34:45,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:34:45,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:34:45,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:34:45,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:34:45,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:34:45,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:34:45,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:34:45,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:34:45,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:34:45,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:34:45,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:34:45,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:34:45,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:34:45,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:34:45,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:34:45,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:34:45,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:34:45,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:34:45,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:34:45,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:34:45,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:34:45,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:34:45,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:34:45,756 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 03:34:45,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:34:45,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:34:45,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:34:45,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:34:45,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:34:45,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:34:45,813 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:34:45,813 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:34:45,813 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:34:45,814 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:34:45,815 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:34:45,815 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:34:45,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:34:45,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:34:45,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:34:45,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:34:45,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:34:45,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:34:45,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:34:45,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:34:45,818 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 03:34:45,818 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 03:34:45,819 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:34:45,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:34:45,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:34:45,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:34:45,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:34:45,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 03:34:45,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:34:45,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:45,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:34:45,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:34:45,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:34:45,821 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 03:34:45,821 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 03:34:45,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:34:45,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:34:45,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 03:34:45,822 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-03 03:34:46,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:34:46,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:34:46,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:34:46,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:34:46,204 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:34:46,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-03 03:34:46,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/baee60b97/521e8680041b4f39ae46df277c0e38c0/FLAGb617703b1 [2022-11-03 03:34:46,789 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:34:46,790 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-03 03:34:46,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/baee60b97/521e8680041b4f39ae46df277c0e38c0/FLAGb617703b1 [2022-11-03 03:34:47,178 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/data/baee60b97/521e8680041b4f39ae46df277c0e38c0 [2022-11-03 03:34:47,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:34:47,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:34:47,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:47,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:34:47,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:34:47,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7d9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47, skipping insertion in model container [2022-11-03 03:34:47,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:34:47,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:34:47,349 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-03 03:34:47,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:47,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:34:47,392 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_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-03 03:34:47,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:34:47,462 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:34:47,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47 WrapperNode [2022-11-03 03:34:47,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:34:47,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:47,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:34:47,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:34:47,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,501 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-03 03:34:47,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:34:47,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:34:47,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:34:47,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:34:47,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:34:47,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:34:47,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:34:47,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:34:47,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (1/1) ... [2022-11-03 03:34:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:34:47,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:47,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:34:47,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:34:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:34:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:34:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:34:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 03:34:47,686 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:34:47,688 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:34:48,224 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:34:48,244 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:34:48,245 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:34:48,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:48 BoogieIcfgContainer [2022-11-03 03:34:48,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:34:48,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:34:48,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:34:48,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:34:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:34:47" (1/3) ... [2022-11-03 03:34:48,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ea9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:48, skipping insertion in model container [2022-11-03 03:34:48,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:47" (2/3) ... [2022-11-03 03:34:48,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ea9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:48, skipping insertion in model container [2022-11-03 03:34:48,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:48" (3/3) ... [2022-11-03 03:34:48,256 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-03 03:34:48,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:34:48,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:34:48,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:34:48,346 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10804685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:34:48,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:34:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) [2022-11-03 03:34:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:34:48,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:48,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:34:48,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-03 03:34:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:34:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932998428] [2022-11-03 03:34:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:48,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:34:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:34:48,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:34:48,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 03:34:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:48,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:34:48,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:48,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:34:48,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:34:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932998428] [2022-11-03 03:34:48,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932998428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:34:48,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:34:48,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:34:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835196646] [2022-11-03 03:34:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:34:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:34:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:34:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:34:48,624 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-11-03 03:34:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:48,639 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-03 03:34:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:34:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-03 03:34:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:48,649 INFO L225 Difference]: With dead ends: 20 [2022-11-03 03:34:48,650 INFO L226 Difference]: Without dead ends: 8 [2022-11-03 03:34:48,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:34:48,657 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:48,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-11-03 03:34:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-03 03:34:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-03 03:34:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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) [2022-11-03 03:34:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-03 03:34:48,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-03 03:34:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:48,691 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-03 03:34:48,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-11-03 03:34:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-03 03:34:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:34:48,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:48,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:34:48,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 03:34:48,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:34:48,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-03 03:34:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:34:48,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569572135] [2022-11-03 03:34:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:34:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:34:48,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:34:48,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 03:34:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:49,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:34:49,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:49,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:52,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:34:52,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569572135] [2022-11-03 03:34:52,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569572135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:52,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314229758] [2022-11-03 03:34:52,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:34:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:34:52,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:34:52,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-03 03:34:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:53,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:34:53,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:53,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:53,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1314229758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:53,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118430579] [2022-11-03 03:34:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:53,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:53,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:53,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:34:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:53,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:34:53,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:34:54,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:35:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:35:05,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118430579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:35:05,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:35:05,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 14 [2022-11-03 03:35:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861196022] [2022-11-03 03:35:05,311 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:35:05,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:35:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:35:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:35:05,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=143, Unknown=1, NotChecked=0, Total=182 [2022-11-03 03:35:05,320 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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) [2022-11-03 03:35:49,433 WARN L234 SmtUtils]: Spent 31.93s on a formula simplification. DAG size of input: 23 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:35:51,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:35:53,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:35:59,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:36:01,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:36:02,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:36:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:03,022 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-03 03:36:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:36:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 7 [2022-11-03 03:36:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:03,024 INFO L225 Difference]: With dead ends: 15 [2022-11-03 03:36:03,024 INFO L226 Difference]: Without dead ends: 11 [2022-11-03 03:36:03,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=74, Invalid=230, Unknown=2, NotChecked=0, Total=306 [2022-11-03 03:36:03,026 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2022-11-03 03:36:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-03 03:36:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-03 03:36:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) [2022-11-03 03:36:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-03 03:36:03,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-03 03:36:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:03,032 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-03 03:36:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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) [2022-11-03 03:36:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-03 03:36:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:36:03,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:03,034 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:03,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:03,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:03,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:36:03,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:36:03,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:36:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-03 03:36:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:36:03,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11938256] [2022-11-03 03:36:03,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:36:03,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:36:03,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:36:03,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:36:03,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 03:36:03,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:36:03,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:03,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:36:03,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:05,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:30,115 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from false [2022-11-03 03:36:37,735 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-11-03 03:36:39,764 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-11-03 03:36:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:36:39,773 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:36:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11938256] [2022-11-03 03:36:39,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11938256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390931562] [2022-11-03 03:36:39,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:36:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:36:39,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:36:39,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:36:39,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-03 03:36:40,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:36:40,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:40,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:36:40,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:40,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:36:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:36:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1390931562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:36:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819436332] [2022-11-03 03:36:50,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:36:50,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:50,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:50,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:50,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:36:54,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:36:54,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:36:54,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:36:54,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:54,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:28,553 WARN L234 SmtUtils]: Spent 10.41s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:37:46,244 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-03 03:38:08,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2022-11-03 03:38:10,772 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2022-11-03 03:38:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:38:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819436332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:10,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:38:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 17 [2022-11-03 03:38:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672445509] [2022-11-03 03:38:10,793 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:38:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:38:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:38:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=99, Unknown=11, NotChecked=100, Total=272 [2022-11-03 03:38:10,795 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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) [2022-11-03 03:38:11,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:13,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:15,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:26,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:43,237 WARN L234 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:38:45,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:47,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:55,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:38:57,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:39:00,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:39:05,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:39:07,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:39:09,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:39:41,219 WARN L234 SmtUtils]: Spent 24.36s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:39:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:42,396 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-03 03:39:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:39:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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 10 [2022-11-03 03:39:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:42,420 INFO L225 Difference]: With dead ends: 19 [2022-11-03 03:39:42,420 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 03:39:42,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 124.8s TimeCoverageRelationStatistics Valid=118, Invalid=193, Unknown=11, NotChecked=140, Total=462 [2022-11-03 03:39:42,422 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 18 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:42,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 44 Invalid, 7 Unknown, 44 Unchecked, 27.1s Time] [2022-11-03 03:39:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 03:39:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 03:39:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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) [2022-11-03 03:39:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-03 03:39:42,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-11-03 03:39:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:42,427 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-03 03:39:42,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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) [2022-11-03 03:39:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-03 03:39:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:39:42,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:42,429 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:42,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:42,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:42,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:43,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:39:43,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:39:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 3 times [2022-11-03 03:39:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:39:43,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558118085] [2022-11-03 03:39:43,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:39:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:39:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:39:43,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:39:43,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 03:39:43,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:39:43,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:39:43,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 03:39:43,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:40:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:40:03,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:40:35,753 WARN L234 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:40:54,151 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-03 03:41:12,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2022-11-03 03:41:14,394 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2022-11-03 03:41:32,917 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-03 03:41:34,960 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-03 03:41:53,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-03 03:41:55,613 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-03 03:42:14,312 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-03 03:42:16,361 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-03 03:42:35,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2022-11-03 03:42:37,186 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2022-11-03 03:42:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-03 03:42:37,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:42:37,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558118085] [2022-11-03 03:42:37,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558118085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:37,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1532379879] [2022-11-03 03:42:37,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:42:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:42:37,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:42:37,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-03 03:42:38,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:42:38,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:38,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 03:42:38,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:38,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:10,323 WARN L234 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:43:20,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2)) (.cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from false [2022-11-03 03:43:22,246 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2)) (.cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from true [2022-11-03 03:43:32,474 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from false [2022-11-03 03:43:34,510 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from true [2022-11-03 03:43:44,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) .cse1) .cse1)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1) .cse1) .cse1))) (or (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse1) .cse1) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 .cse1) .cse1)) (not (fp.lt .cse0 .cse2))))) is different from false [2022-11-03 03:43:46,828 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) .cse1) .cse1)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1) .cse1) .cse1))) (or (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse1) .cse1) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 .cse1) .cse1)) (not (fp.lt .cse0 .cse2))))) is different from true [2022-11-03 03:43:57,142 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2) .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2) .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from false [2022-11-03 03:43:59,188 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2) .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2) .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from true [2022-11-03 03:44:09,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (or (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse1) .cse1) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 .cse1) .cse1)) (not (fp.lt .cse0 .cse2))))) is different from false [2022-11-03 03:44:11,599 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (or (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse1) .cse1) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 .cse1) .cse1)) (not (fp.lt .cse0 .cse2))))) is different from true [2022-11-03 03:44:22,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2) .cse2) .cse2) .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2) .cse2) .cse2) .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from false [2022-11-03 03:44:24,097 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2) .cse2) .cse2) .cse2) .cse2)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2) .cse2) .cse2) .cse2) .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse2) .cse2) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 .cse2) .cse2))))) is different from true [2022-11-03 03:44:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-03 03:44:24,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1532379879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:24,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558810442] [2022-11-03 03:44:24,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:44:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:24,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:24,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4e3fefc-7c9a-47ff-9f5a-f5995463749f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:44:44,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:44:44,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:44,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 03:44:44,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:45:17,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:26,725 WARN L234 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:47:25,580 WARN L234 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:47:33,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2022-11-03 03:47:35,702 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2022-11-03 03:47:45,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2022-11-03 03:47:47,146 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2022-11-03 03:48:01,517 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24))))) is different from false [2022-11-03 03:48:20,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) (forall ((|v_ULTIMATE.start_main_~y~0#1_84| (_ FloatingPoint 8 24))) (not (fp.lt (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |v_ULTIMATE.start_main_~y~0#1_84|))))) is different from false [2022-11-03 03:48:22,451 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) (forall ((|v_ULTIMATE.start_main_~y~0#1_84| (_ FloatingPoint 8 24))) (not (fp.lt (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |v_ULTIMATE.start_main_~y~0#1_84|))))) is different from true [2022-11-03 03:48:43,900 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1))) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_85| (_ FloatingPoint 8 24))) (not (fp.lt .cse0 |v_ULTIMATE.start_main_~y~0#1_85|))) (forall ((|v_ULTIMATE.start_main_~y~0#1_84| (_ FloatingPoint 8 24))) (not (fp.lt (fp.add c_currentRoundingMode .cse0 .cse1) |v_ULTIMATE.start_main_~y~0#1_84|))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse2) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from true [2022-11-03 03:48:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 5 times theorem prover too weak. 0 trivial. 30 not checked. [2022-11-03 03:48:43,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558810442] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:43,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:48:43,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 12, 12] total 49 [2022-11-03 03:48:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490760208] [2022-11-03 03:48:43,934 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 03:48:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:48:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 03:48:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=795, Unknown=63, NotChecked=1292, Total=2352 [2022-11-03 03:48:43,937 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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) [2022-11-03 03:48:46,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:48,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:49,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:53,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:54,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:56,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:58,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:59,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:03,933 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))) (let ((.cse8 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 .cse0) .cse0) .cse0)) (.cse4 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse10 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse10 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse11 .cse0))) (let ((.cse1 (not (fp.lt .cse10 .cse11))) (.cse2 (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (or .cse1 .cse2 (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6))) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_85| (_ FloatingPoint 8 24))) (not (fp.lt .cse7 |v_ULTIMATE.start_main_~y~0#1_85|))) (forall ((|v_ULTIMATE.start_main_~y~0#1_84| (_ FloatingPoint 8 24))) (not (fp.lt .cse8 |v_ULTIMATE.start_main_~y~0#1_84|))) (let ((.cse9 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (and (fp.geq .cse9 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse9) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (= ((_ to_fp 8 24) c_currentRoundingMode 42.0) |c_ULTIMATE.start_main_~z~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse1 .cse2))))))))) is different from true [2022-11-03 03:49:06,022 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse7))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 .cse7) .cse7) .cse7)) (.cse5 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse7) .cse7) .cse7) .cse7))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse5 .cse7)) (.cse9 (fp.add c_currentRoundingMode .cse4 .cse7))) (let ((.cse2 (fp.add c_currentRoundingMode .cse9 .cse7)) (.cse3 (fp.sub c_currentRoundingMode .cse10 .cse7))) (let ((.cse0 (fp.lt (fp.add c_currentRoundingMode .cse2 .cse7) (fp.sub c_currentRoundingMode .cse3 .cse7))) (.cse1 (not (fp.lt .cse9 .cse10)))) (and (or .cse0 .cse1) (or (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) .cse0 .cse1) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse7) .cse7) .cse7) .cse7) .cse7) .cse7) .cse7))) (and (fp.geq .cse6 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse6) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) (forall ((|v_ULTIMATE.start_main_~y~0#1_84| (_ FloatingPoint 8 24))) (not (fp.lt .cse8 |v_ULTIMATE.start_main_~y~0#1_84|)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse7 .cse7)) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse7) |c_ULTIMATE.start_main_~z~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))))))) is different from true [2022-11-03 03:49:08,100 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse8 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse2 (fp.add c_currentRoundingMode .cse8 .cse0)) (.cse3 (fp.sub c_currentRoundingMode .cse9 .cse0))) (let ((.cse1 (not (fp.lt .cse8 .cse9))) (.cse4 (fp.lt (fp.add c_currentRoundingMode .cse2 .cse0) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (or .cse1 (not (fp.lt .cse2 .cse3)) .cse4 (not (fp.lt .cse5 .cse6))) (or .cse1 .cse4) (= |c_ULTIMATE.start_main_~z~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse0) .cse0)) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse7) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse7 (_ +zero 8 24))))) (= c_currentRoundingMode roundNearestTiesToEven))))))) is different from true [2022-11-03 03:49:10,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2)) (.cse5 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse5 .cse2)) (.cse8 (fp.add c_currentRoundingMode .cse4 .cse2))) (let ((.cse6 (fp.add c_currentRoundingMode .cse8 .cse2)) (.cse7 (fp.sub c_currentRoundingMode .cse9 .cse2))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse2) .cse2) .cse2) .cse2) .cse2)) (.cse0 (fp.lt (fp.add c_currentRoundingMode .cse6 .cse2) (fp.sub c_currentRoundingMode .cse7 .cse2))) (.cse1 (not (fp.lt .cse8 .cse9)))) (and (or .cse0 .cse1) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~x~0#1|) (fp.geq .cse3 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse3) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~y~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~z~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) .cse0 .cse1))))))) is different from false [2022-11-03 03:49:12,238 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) .cse2)) (.cse5 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2) .cse2))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse5 .cse2)) (.cse8 (fp.add c_currentRoundingMode .cse4 .cse2))) (let ((.cse6 (fp.add c_currentRoundingMode .cse8 .cse2)) (.cse7 (fp.sub c_currentRoundingMode .cse9 .cse2))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse2) .cse2) .cse2) .cse2) .cse2)) (.cse0 (fp.lt (fp.add c_currentRoundingMode .cse6 .cse2) (fp.sub c_currentRoundingMode .cse7 .cse2))) (.cse1 (not (fp.lt .cse8 .cse9)))) (and (or .cse0 .cse1) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~x~0#1|) (fp.geq .cse3 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse3) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~y~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse2) .cse2) .cse2) |c_ULTIMATE.start_main_~z~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) .cse0 .cse1))))))) is different from true [2022-11-03 03:49:14,300 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse5 .cse1)) (.cse8 (fp.add c_currentRoundingMode .cse4 .cse1))) (let ((.cse6 (fp.add c_currentRoundingMode .cse8 .cse1)) (.cse7 (fp.sub c_currentRoundingMode .cse9 .cse1))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)) (.cse2 (not (fp.lt .cse8 .cse9))) (.cse3 (fp.lt (fp.add c_currentRoundingMode .cse6 .cse1) (fp.sub c_currentRoundingMode .cse7 .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (or .cse2 .cse3) (or .cse2 (not (fp.lt .cse4 .cse5)) .cse3 (not (fp.lt .cse6 .cse7))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse1) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))))))) is different from true [2022-11-03 03:49:17,302 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (let ((.cse2 (not (fp.lt .cse5 .cse6))) (.cse3 (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)))) (and (or (not (fp.lt .cse0 .cse1)) .cse2 .cse3 (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse4) .cse4) .cse4) .cse4) .cse4) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4) .cse4) .cse4) .cse4) .cse4) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~z~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse4) .cse4) .cse4) .cse4) .cse4)) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-11-03 03:49:20,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:23,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:26,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:28,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse5))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse3 (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse7 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100000000.0))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1) (fp.geq .cse2 (_ +zero 8 24)) .cse3 (or (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not .cse3)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse7) .cse1) (fp.geq .cse7 (_ +zero 8 24)) (fp.geq |c_ULTIMATE.start_main_~z~0#1| (_ +zero 8 24)) (fp.lt .cse4 .cse6) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1|) .cse1) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2022-11-03 03:49:30,233 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse5))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse3 (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse7 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100000000.0))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1) (fp.geq .cse2 (_ +zero 8 24)) .cse3 (or (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not .cse3)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse7) .cse1) (fp.geq .cse7 (_ +zero 8 24)) (fp.geq |c_ULTIMATE.start_main_~z~0#1| (_ +zero 8 24)) (fp.lt .cse4 .cse6) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1|) .cse1) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-11-03 03:49:32,280 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100000000.0))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1) (fp.geq .cse2 (_ +zero 8 24)) (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|) (fp.geq |c_ULTIMATE.start_main_~z~0#1| (_ +zero 8 24)) (fp.lt (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1|) .cse1) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1))))) is different from false [2022-11-03 03:49:51,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:53,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:57,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:59,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:50:00,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:50:02,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:50:05,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 03:50:07,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []