./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-2329fc7 [2022-12-14 12:27:11,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:27:11,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:27:11,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:27:11,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:27:11,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:27:11,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:27:11,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:27:11,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:27:11,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:27:11,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:27:11,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:27:11,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:27:11,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:27:11,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:27:11,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:27:11,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:27:11,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:27:11,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:27:11,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:27:11,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:27:11,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:27:11,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:27:11,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:27:11,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:27:11,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:27:11,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:27:11,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:27:11,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:27:11,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:27:11,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:27:11,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:27:11,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:27:11,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:27:11,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:27:11,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:27:11,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:27:11,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:27:11,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:27:11,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:27:11,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:27:11,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 12:27:11,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:27:11,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:27:11,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:27:11,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:27:11,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:27:11,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:27:11,748 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:27:11,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:27:11,748 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:27:11,753 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:27:11,754 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:27:11,754 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:27:11,754 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:27:11,754 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:27:11,754 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:27:11,754 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:27:11,755 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:27:11,755 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:27:11,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:27:11,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:27:11,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:27:11,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:27:11,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:27:11,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:27:11,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:27:11,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:27:11,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:27:11,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:11,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:27:11,758 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:27:11,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:27:11,760 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-12-14 12:27:11,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:27:11,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:27:11,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:27:11,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:27:11,943 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:27:11,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-14 12:27:14,448 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:27:14,603 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:27:14,603 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-14 12:27:14,607 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/022c16ed7/ac94f435d3984ce6879a423d2aa60eab/FLAG143c53a53 [2022-12-14 12:27:15,022 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/022c16ed7/ac94f435d3984ce6879a423d2aa60eab [2022-12-14 12:27:15,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:27:15,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:27:15,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:15,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:27:15,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:27:15,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a94a5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15, skipping insertion in model container [2022-12-14 12:27:15,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:27:15,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:27:15,159 WARN L237 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-14 12:27:15,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:15,175 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:27:15,184 WARN L237 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-14 12:27:15,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:15,195 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:27:15,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15 WrapperNode [2022-12-14 12:27:15,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:15,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:15,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:27:15,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:27:15,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,217 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-12-14 12:27:15,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:15,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:27:15,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:27:15,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:27:15,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:27:15,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:27:15,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:27:15,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:27:15,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (1/1) ... [2022-12-14 12:27:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:27:15,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:27:15,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:27:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:27:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:27:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:27:15,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:27:15,340 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:27:15,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:27:15,397 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:27:15,413 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:27:15,413 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 12:27:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:15 BoogieIcfgContainer [2022-12-14 12:27:15,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:27:15,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:27:15,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:27:15,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:27:15,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:27:15" (1/3) ... [2022-12-14 12:27:15,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7511bfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:15, skipping insertion in model container [2022-12-14 12:27:15,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:15" (2/3) ... [2022-12-14 12:27:15,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7511bfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:15, skipping insertion in model container [2022-12-14 12:27:15,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:15" (3/3) ... [2022-12-14 12:27:15,421 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-12-14 12:27:15,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:27:15,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:27:15,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:27:15,472 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;@4ef9638d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:27:15,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 12:27:15,475 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-12-14 12:27:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 12:27:15,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:27:15,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 12:27:15,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:27:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:27:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1880294, now seen corresponding path program 1 times [2022-12-14 12:27:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:27:15,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505887692] [2022-12-14 12:27:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:27:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:27:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:27:15,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 12:27:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:27:15,572 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 12:27:15,573 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 12:27:15,574 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 12:27:15,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:27:15,578 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-14 12:27:15,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 12:27:15,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 12:27:15 BoogieIcfgContainer [2022-12-14 12:27:15,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 12:27:15,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 12:27:15,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 12:27:15,593 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 12:27:15,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:15" (3/4) ... [2022-12-14 12:27:15,595 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 12:27:15,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 12:27:15,596 INFO L158 Benchmark]: Toolchain (without parser) took 570.85ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 67.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-14 12:27:15,597 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:27:15,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.48ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 92.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 12:27:15,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.51ms. Allocated memory is still 136.3MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:27:15,598 INFO L158 Benchmark]: Boogie Preprocessor took 14.75ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 90.8MB in the end (delta: 899.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 12:27:15,598 INFO L158 Benchmark]: RCFGBuilder took 181.58ms. Allocated memory is still 136.3MB. Free memory was 90.4MB in the beginning and 81.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 12:27:15,598 INFO L158 Benchmark]: TraceAbstraction took 175.59ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 67.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 12:27:15,598 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 136.3MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:27:15,600 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.12ms. Allocated memory is still 136.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.48ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 92.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.51ms. Allocated memory is still 136.3MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.75ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 90.8MB in the end (delta: 899.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 181.58ms. Allocated memory is still 136.3MB. Free memory was 90.4MB in the beginning and 81.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 175.59ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 67.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 136.3MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: 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 23, overapproximation of someBinaryArithmeticFLOAToperation at line 21. Possible FailurePath: [L20] float x = 1.0f; [L21] float x1 = x/1.6f; VAL [x=1] [L23] COND FALSE !(x1 != x) [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] 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.1s, 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-12-14 12:27:15,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- 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-2329fc7 [2022-12-14 12:27:17,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:27:17,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:27:17,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:27:17,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:27:17,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:27:17,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:27:17,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:27:17,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:27:17,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:27:17,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:27:17,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:27:17,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:27:17,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:27:17,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:27:17,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:27:17,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:27:17,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:27:17,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:27:17,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:27:17,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:27:17,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:27:17,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:27:17,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:27:17,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:27:17,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:27:17,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:27:17,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:27:17,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:27:17,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:27:17,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:27:17,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:27:17,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:27:17,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:27:17,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:27:17,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:27:17,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:27:17,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:27:17,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:27:17,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:27:17,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:27:17,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 12:27:17,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:27:17,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:27:17,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:27:17,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:27:17,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:27:17,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:27:17,371 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:27:17,371 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:27:17,372 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:27:17,372 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:27:17,372 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:27:17,372 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:27:17,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:27:17,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:27:17,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:27:17,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:27:17,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:27:17,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:27:17,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:27:17,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:27:17,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:27:17,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 12:27:17,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:27:17,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:17,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:27:17,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:27:17,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 12:27:17,376 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2022-12-14 12:27:17,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:27:17,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:27:17,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:27:17,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:27:17,624 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:27:17,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-14 12:27:20,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:27:20,331 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:27:20,332 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2022-12-14 12:27:20,336 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/2007de8fb/8ea2c4c1c93e441582c0bc8f08c1888f/FLAGb7e5469f4 [2022-12-14 12:27:20,347 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/data/2007de8fb/8ea2c4c1c93e441582c0bc8f08c1888f [2022-12-14 12:27:20,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:27:20,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:27:20,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:20,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:27:20,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:27:20,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9e4ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20, skipping insertion in model container [2022-12-14 12:27:20,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:27:20,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:27:20,477 WARN L237 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-14 12:27:20,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:20,495 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:27:20,504 WARN L237 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_50c405fb-1a0c-4e09-94c7-2437f8f3e307/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2022-12-14 12:27:20,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:20,517 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:27:20,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20 WrapperNode [2022-12-14 12:27:20,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:20,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:20,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:27:20,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:27:20,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,543 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-12-14 12:27:20,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:20,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:27:20,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:27:20,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:27:20,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,559 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:27:20,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:27:20,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:27:20,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:27:20,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (1/1) ... [2022-12-14 12:27:20,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:27:20,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:27:20,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:27:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:27:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 12:27:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:27:20,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:27:20,676 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:27:20,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:27:21,371 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:27:21,375 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:27:21,375 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 12:27:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:21 BoogieIcfgContainer [2022-12-14 12:27:21,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:27:21,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:27:21,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:27:21,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:27:21,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:27:20" (1/3) ... [2022-12-14 12:27:21,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6755e30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:21, skipping insertion in model container [2022-12-14 12:27:21,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:20" (2/3) ... [2022-12-14 12:27:21,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6755e30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:21, skipping insertion in model container [2022-12-14 12:27:21,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:21" (3/3) ... [2022-12-14 12:27:21,383 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2022-12-14 12:27:21,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:27:21,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:27:21,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:27:21,448 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;@1cd1620a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:27:21,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 12:27:21,451 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-12-14 12:27:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 12:27:21,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:27:21,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 12:27:21,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:27:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:27:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-12-14 12:27:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:27:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640872653] [2022-12-14 12:27:21,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:27:21,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:27:21,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:27:21,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:27:21,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 12:27:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:27:21,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:27:21,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:27:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:27:23,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:27:23,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:27:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640872653] [2022-12-14 12:27:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640872653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:27:23,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:27:23,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:27:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731839375] [2022-12-14 12:27:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:27:23,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:27:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:27:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:27:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:27:23,182 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 4 states, 4 states have (on average 1.5) 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-12-14 12:27:24,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:27:24,522 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-12-14 12:27:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:27:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-12-14 12:27:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:27:24,529 INFO L225 Difference]: With dead ends: 20 [2022-12-14 12:27:24,530 INFO L226 Difference]: Without dead ends: 8 [2022-12-14 12:27:24,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:27:24,533 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 12:27:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 12:27:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-12-14 12:27:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-12-14 12:27:24,553 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-12-14 12:27:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-12-14 12:27:24,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-12-14 12:27:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:27:24,554 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-12-14 12:27:24,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-12-14 12:27:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-12-14 12:27:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 12:27:24,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:27:24,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:27:24,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:27:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:27:24,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:27:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:27:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-12-14 12:27:24,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:27:24,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938248424] [2022-12-14 12:27:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:27:24,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:27:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:27:24,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:27:24,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 12:27:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:27:25,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:27:25,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:27:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:27:28,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:27:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:27:39,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:27:39,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938248424] [2022-12-14 12:27:39,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938248424] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:27:39,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675405052] [2022-12-14 12:27:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:27:39,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:27:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:27:39,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:27:39,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-12-14 12:27:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:27:40,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:27:40,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:27:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:27:41,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:27:49,314 WARN L859 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-12-14 12:27:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:27:49,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1675405052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:27:49,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419403488] [2022-12-14 12:27:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:27:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:27:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:27:49,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:27:49,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:27:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:27:50,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 12:27:50,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:07,052 WARN L859 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-12-14 12:28:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 12:28:09,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419403488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:09,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:28:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 6] total 14 [2022-12-14 12:28:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119790544] [2022-12-14 12:28:09,961 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:09,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 12:28:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:28:09,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 12:28:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=96, Unknown=2, NotChecked=42, Total=182 [2022-12-14 12:28:09,963 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:28:20,482 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-12-14 12:28:24,142 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-12-14 12:28:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:25,451 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-12-14 12:28:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:28:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 12:28:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:25,452 INFO L225 Difference]: With dead ends: 14 [2022-12-14 12:28:25,452 INFO L226 Difference]: Without dead ends: 10 [2022-12-14 12:28:25,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=49, Invalid=112, Unknown=3, NotChecked=46, Total=210 [2022-12-14 12:28:25,453 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:25,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 16 Unchecked, 6.3s Time] [2022-12-14 12:28:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-12-14 12:28:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-12-14 12:28:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-12-14 12:28:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-12-14 12:28:25,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2022-12-14 12:28:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:25,456 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-12-14 12:28:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:28:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-12-14 12:28:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 12:28:25,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:25,457 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:25,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2022-12-14 12:28:25,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:28:25,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 12:28:26,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:28:26,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:28:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 2 times [2022-12-14 12:28:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:28:26,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858549786] [2022-12-14 12:28:26,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:28:26,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:28:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:28:26,066 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:28:26,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 12:28:26,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:28:26,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:28:26,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 12:28:26,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:32,384 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-14 12:28:38,840 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-14 12:28:46,448 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-14 12:28:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 12:28:46,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:29:04,918 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:29:13,758 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:29:25,086 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:29:27,208 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:29:38,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-12-14 12:29:40,699 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-12-14 12:29:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 12:29:40,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:29:40,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858549786] [2022-12-14 12:29:40,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858549786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:29:40,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [967763072] [2022-12-14 12:29:40,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:29:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:29:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:29:40,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:29:40,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-12-14 12:29:41,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:29:41,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:29:41,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 12:29:41,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:29:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 12:29:52,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:30:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 12:30:20,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [967763072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:30:20,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623798321] [2022-12-14 12:30:20,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:30:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:30:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:30:20,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:30:20,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:30:30,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:30:30,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:30:30,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 12:30:30,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:30:56,489 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:31:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 12:31:02,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:31:24,169 WARN L233 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:31:39,404 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:31:54,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-14 12:31:56,962 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-14 12:32:12,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false [2022-12-14 12:32:15,104 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true [2022-12-14 12:32:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 12:32:15,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623798321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:32:15,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:32:15,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6, 8, 6, 8] total 18 [2022-12-14 12:32:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646428457] [2022-12-14 12:32:15,105 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:32:15,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 12:32:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:32:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 12:32:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=61, Unknown=25, NotChecked=216, Total=342 [2022-12-14 12:32:15,106 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:32:16,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-14 12:32:19,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (let ((.cse0 (fp.eq .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse4) .cse2)))) (and (or .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse0 (fp.eq .cse2 .cse3) .cse1)))))) is different from false [2022-12-14 12:32:21,637 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (let ((.cse0 (fp.eq .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse4) .cse2)))) (and (or .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse0 (fp.eq .cse2 .cse3) .cse1)))))) is different from true [2022-12-14 12:32:23,835 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse4))) (let ((.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse4) .cse0))) (.cse3 (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or (fp.eq .cse0 .cse1) .cse2 .cse3) (or .cse2 .cse3) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-12-14 12:32:25,933 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse3) .cse1))) (.cse2 (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 (fp.eq .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (or .cse0 .cse2) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse3) .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-12-14 12:32:27,999 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode .cse1 .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-14 12:32:53,591 WARN L233 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 22 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:32:56,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:32:59,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:33:24,840 WARN L233 SmtUtils]: Spent 16.31s on a formula simplification. DAG size of input: 19 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:33:39,088 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:33:41,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:33:43,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:03,604 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:34:05,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:07,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:09,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:11,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:26,897 WARN L233 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:34:28,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:31,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:33,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 12:34:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:34:33,842 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-12-14 12:34:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 12:34:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 12:34:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:34:33,877 INFO L225 Difference]: With dead ends: 19 [2022-12-14 12:34:33,877 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 12:34:33,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 195.0s TimeCoverageRelationStatistics Valid=92, Invalid=158, Unknown=42, NotChecked=520, Total=812 [2022-12-14 12:34:33,878 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2022-12-14 12:34:33,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 9 Unknown, 74 Unchecked, 28.5s Time] [2022-12-14 12:34:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 12:34:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 12:34:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-12-14 12:34:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 12:34:33,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2022-12-14 12:34:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:34:33,882 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 12:34:33,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:34:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 12:34:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 12:34:33,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:34:33,882 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2022-12-14 12:34:33,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-12-14 12:34:34,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 12:34:34,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:34:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:34:34,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:34:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:34:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 3 times [2022-12-14 12:34:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:34:34,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11102276] [2022-12-14 12:34:34,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:34:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:34:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:34:34,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:34:34,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 12:34:35,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 12:34:35,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:34:35,848 WARN L261 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 12:34:35,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:34:42,053 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-14 12:34:56,818 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:35:04,020 WARN L859 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2022-12-14 12:35:11,911 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-14 12:35:19,301 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-14 12:35:25,774 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:35:28,338 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-14 12:35:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 12:35:32,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:35:57,984 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 12:36:12,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:36:15,049 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:36:30,636 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-14 12:36:32,798 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-14 12:36:48,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from false [2022-12-14 12:36:51,195 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from true [2022-12-14 12:37:07,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false [2022-12-14 12:37:10,165 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true [2022-12-14 12:37:27,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-14 12:37:29,725 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-14 12:37:34,920 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:37:40,105 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:37:45,203 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:37:47,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-12-14 12:37:49,910 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-12-14 12:37:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 12:37:49,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:37:49,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11102276] [2022-12-14 12:37:49,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11102276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:37:49,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1924866716] [2022-12-14 12:37:49,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:37:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:37:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:37:49,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:37:49,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-12-14 12:37:52,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 12:37:52,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:37:52,151 WARN L261 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 12:37:52,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:38:15,342 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-14 12:38:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 12:38:23,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:38:30,528 WARN L859 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-12-14 12:38:36,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:38:38,872 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:38:49,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:38:52,173 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:39:03,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:39:05,952 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:39:17,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-12-14 12:39:20,179 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-12-14 12:39:30,186 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:39:32,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:39:34,845 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:39:39,900 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:39:47,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-12-14 12:39:49,619 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-12-14 12:39:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-12-14 12:39:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1924866716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:49,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950987271] [2022-12-14 12:39:49,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:39:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:49,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:49,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:49,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c405fb-1a0c-4e09-94c7-2437f8f3e307/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:40:16,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 12:40:16,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:40:16,912 WARN L261 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 12:40:16,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:40:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 12:40:48,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:41:56,532 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:42:01,575 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:42:06,616 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:42:11,670 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:42:16,731 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 12:42:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 12:42:21,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950987271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:42:21,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:42:21,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9, 11, 9, 11] total 27 [2022-12-14 12:42:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895850782] [2022-12-14 12:42:21,724 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:42:21,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 12:42:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:42:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 12:42:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=56, Unknown=36, NotChecked=608, Total=756 [2022-12-14 12:42:21,726 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-12-14 12:42:23,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-14 12:42:26,188 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse4) .cse2))) (.cse1 (fp.eq .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (or (fp.eq .cse2 .cse3) .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-12-14 12:42:28,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2) .cse2))) (let ((.cse3 (fp.div c_currentRoundingMode .cse4 .cse2))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse3 .cse2) .cse3))) (.cse1 (fp.eq .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2)) (or .cse0 (fp.eq .cse3 .cse4) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2022-12-14 12:42:30,735 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2) .cse2))) (let ((.cse3 (fp.div c_currentRoundingMode .cse4 .cse2))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse3 .cse2) .cse3))) (.cse1 (fp.eq .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2)) (or .cse0 (fp.eq .cse3 .cse4) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-12-14 12:42:33,033 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) .cse4) .cse4))) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (let ((.cse0 (fp.eq .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse1 (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse4) .cse2)))) (and (or .cse0 .cse1) (or .cse0 (fp.eq .cse2 .cse3) .cse1) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-12-14 12:42:35,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2))) (let ((.cse3 (fp.div c_currentRoundingMode .cse4 .cse2))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse3 .cse2) .cse3))) (.cse1 (fp.eq .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2)) (or .cse0 .cse1 (fp.eq .cse3 .cse4)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2022-12-14 12:42:37,410 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2))) (let ((.cse3 (fp.div c_currentRoundingMode .cse4 .cse2))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse3 .cse2) .cse3))) (.cse1 (fp.eq .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2)) (or .cse0 .cse1 (fp.eq .cse3 .cse4)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-12-14 12:42:39,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse4))) (let ((.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse4) .cse0))) (.cse3 (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or (fp.eq .cse0 .cse1) .cse2 .cse3) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4) .cse4) .cse4))))))) is different from false [2022-12-14 12:42:41,911 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse4))) (let ((.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse4) .cse0))) (.cse3 (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or (fp.eq .cse0 .cse1) .cse2 .cse3) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse4) .cse4) .cse4) .cse4))))))) is different from true