./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:51:10,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:51:10,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:51:10,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:51:10,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:51:10,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:51:10,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:51:10,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:51:10,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:51:10,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:51:10,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:51:10,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:51:10,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:51:10,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:51:10,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:51:10,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:51:10,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:51:10,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:51:10,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:51:10,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:51:10,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:51:10,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:51:10,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:51:10,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:51:10,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:51:10,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:51:10,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:51:10,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:51:10,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:51:10,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:51:10,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:51:10,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:51:10,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:51:10,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:51:10,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:51:10,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:51:10,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:51:10,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:51:10,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:51:10,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:51:10,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:51:10,637 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:51:10,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:51:10,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:51:10,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:51:10,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:51:10,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:51:10,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:51:10,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:51:10,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:51:10,684 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:51:10,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:51:10,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:51:10,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:51:10,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:51:10,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:51:10,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:51:10,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:51:10,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:51:10,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:51:10,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:51:10,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:51:10,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:51:10,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:51:10,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:51:10,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:51:10,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:10,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:51:10,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:51:10,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:51:10,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:51:10,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:51:10,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:51:10,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:51:10,691 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:51:10,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:51:10,692 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-25 16:51:11,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:51:11,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:51:11,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:51:11,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:51:11,091 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:51:11,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-25 16:51:14,257 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:51:14,486 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:51:14,487 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-25 16:51:14,498 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/29dd5a283/860d4f79b8f6442aa920558106cccbc7/FLAG9b37866e4 [2022-11-25 16:51:14,521 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/29dd5a283/860d4f79b8f6442aa920558106cccbc7 [2022-11-25 16:51:14,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:51:14,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:51:14,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:14,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:51:14,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:51:14,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31055595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14, skipping insertion in model container [2022-11-25 16:51:14,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:51:14,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:51:14,767 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-25 16:51:14,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:14,789 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:51:14,801 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-25 16:51:14,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:14,817 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:51:14,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14 WrapperNode [2022-11-25 16:51:14,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:14,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:14,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:51:14,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:51:14,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,853 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-25 16:51:14,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:14,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:51:14,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:51:14,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:51:14,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:51:14,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:51:14,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:51:14,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:51:14,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (1/1) ... [2022-11-25 16:51:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:14,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:51:14,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:51:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:51:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:51:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:51:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:51:15,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:51:15,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:51:15,201 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:51:15,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:51:15,212 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:51:15,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:15 BoogieIcfgContainer [2022-11-25 16:51:15,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:51:15,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:51:15,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:51:15,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:51:15,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:51:14" (1/3) ... [2022-11-25 16:51:15,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:15, skipping insertion in model container [2022-11-25 16:51:15,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:14" (2/3) ... [2022-11-25 16:51:15,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:15, skipping insertion in model container [2022-11-25 16:51:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:15" (3/3) ... [2022-11-25 16:51:15,229 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-25 16:51:15,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:51:15,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 16:51:15,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:51:15,346 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@724ef73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:51:15,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 16:51:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:51:15,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:15,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:51:15,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:51:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-25 16:51:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218557660] [2022-11-25 16:51:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:51:15,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:51:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:51:15,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:51:15,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:51:15,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 16:51:15,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:51:15,514 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 16:51:15,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:51:15,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:51:15 BoogieIcfgContainer [2022-11-25 16:51:15,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:51:15,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:51:15,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:51:15,538 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:51:15,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:15" (3/4) ... [2022-11-25 16:51:15,542 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:51:15,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:51:15,543 INFO L158 Benchmark]: Toolchain (without parser) took 1017.53ms. Allocated memory is still 178.3MB. Free memory was 133.6MB in the beginning and 97.5MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 16:51:15,544 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 147.8MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:51:15,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.53ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 123.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:51:15,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 178.3MB. Free memory was 123.1MB in the beginning and 121.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:51:15,546 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 120.6MB in the end (delta: 994.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:51:15,546 INFO L158 Benchmark]: RCFGBuilder took 328.00ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 111.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:51:15,547 INFO L158 Benchmark]: TraceAbstraction took 319.08ms. Allocated memory is still 178.3MB. Free memory was 110.6MB in the beginning and 97.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 16:51:15,547 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 178.3MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:51:15,550 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.23ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 147.8MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.53ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 123.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 178.3MB. Free memory was 123.1MB in the beginning and 121.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 120.6MB in the end (delta: 994.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.00ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 111.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 319.08ms. Allocated memory is still 178.3MB. Free memory was 110.6MB in the beginning and 97.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 178.3MB. Free memory is still 97.5MB. 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: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 16:51:15,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:51:18,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:51:18,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:51:18,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:51:18,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:51:18,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:51:18,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:51:18,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:51:18,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:51:18,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:51:18,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:51:18,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:51:18,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:51:18,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:51:18,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:51:18,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:51:18,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:51:18,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:51:18,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:51:18,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:51:18,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:51:18,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:51:18,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:51:18,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:51:18,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:51:18,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:51:18,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:51:18,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:51:18,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:51:18,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:51:18,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:51:18,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:51:18,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:51:18,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:51:18,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:51:18,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:51:18,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:51:18,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:51:18,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:51:18,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:51:18,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:51:18,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-25 16:51:18,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:51:18,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:51:18,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:51:18,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:51:18,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:51:18,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:51:18,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:51:18,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:51:18,436 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:51:18,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:51:18,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:51:18,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:51:18,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:51:18,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:51:18,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:51:18,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:51:18,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:51:18,438 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 16:51:18,439 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 16:51:18,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:51:18,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:51:18,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:51:18,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:51:18,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:51:18,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:51:18,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:51:18,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:18,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:51:18,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:51:18,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:51:18,442 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 16:51:18,442 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 16:51:18,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:51:18,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:51:18,443 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:51:18,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:51:18,443 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 16:51:18,443 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-25 16:51:18,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:51:18,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:51:18,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:51:18,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:51:18,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:51:18,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-25 16:51:22,029 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:51:22,252 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:51:22,253 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-25 16:51:22,259 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/9fcbed0db/09841c32c70d4500b5a6c33fca8cb5cd/FLAG85e9993ee [2022-11-25 16:51:22,273 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/data/9fcbed0db/09841c32c70d4500b5a6c33fca8cb5cd [2022-11-25 16:51:22,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:51:22,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:51:22,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:22,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:51:22,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:51:22,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff4e5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22, skipping insertion in model container [2022-11-25 16:51:22,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:51:22,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:51:22,500 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-25 16:51:22,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:22,537 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:51:22,556 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_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-25 16:51:22,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:22,580 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:51:22,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22 WrapperNode [2022-11-25 16:51:22,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:22,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:22,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:51:22,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:51:22,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,617 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-25 16:51:22,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:22,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:51:22,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:51:22,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:51:22,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,664 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:51:22,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:51:22,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:51:22,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:51:22,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (1/1) ... [2022-11-25 16:51:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:22,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:22,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:51:22,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:51:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:51:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:51:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:51:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 16:51:22,888 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:51:22,891 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:51:23,511 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:51:23,517 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:51:23,518 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:51:23,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:23 BoogieIcfgContainer [2022-11-25 16:51:23,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:51:23,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:51:23,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:51:23,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:51:23,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:51:22" (1/3) ... [2022-11-25 16:51:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11682ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:23, skipping insertion in model container [2022-11-25 16:51:23,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:22" (2/3) ... [2022-11-25 16:51:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11682ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:23, skipping insertion in model container [2022-11-25 16:51:23,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:23" (3/3) ... [2022-11-25 16:51:23,529 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-25 16:51:23,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:51:23,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 16:51:23,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:51:23,608 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=PETRI_NET, 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;@14358fd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:51:23,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 16:51:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:51:23,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:23,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:51:23,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:51:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-25 16:51:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:51:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856213944] [2022-11-25 16:51:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:23,644 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-11-25 16:51:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:51:23,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:23,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:23,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:51:23,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:23,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:51:23,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:51:23,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856213944] [2022-11-25 16:51:23,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856213944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:23,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:23,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:51:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367320723] [2022-11-25 16:51:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:23,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:51:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:51:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:51:24,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:51:24,029 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:24,311 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-25 16:51:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:51:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 16:51:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:24,324 INFO L225 Difference]: With dead ends: 20 [2022-11-25 16:51:24,324 INFO L226 Difference]: Without dead ends: 8 [2022-11-25 16:51:24,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:51:24,337 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:24,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:51:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-25 16:51:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-25 16:51:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-25 16:51:24,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-25 16:51:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:24,379 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-25 16:51:24,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-25 16:51:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:51:24,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:24,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:24,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:24,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:24,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:51:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-25 16:51:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:51:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045459864] [2022-11-25 16:51:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:24,597 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-11-25 16:51:24,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:51:24,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:24,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:24,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:51:24,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:24,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:29,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:51:29,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045459864] [2022-11-25 16:51:29,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045459864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:29,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:51:29,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-25 16:51:29,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046796529] [2022-11-25 16:51:29,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:29,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:51:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2022-11-25 16:51:29,218 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:36,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:51:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:38,305 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-25 16:51:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:51:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:51:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:38,313 INFO L225 Difference]: With dead ends: 15 [2022-11-25 16:51:38,313 INFO L226 Difference]: Without dead ends: 11 [2022-11-25 16:51:38,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2022-11-25 16:51:38,316 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:38,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 16:51:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-25 16:51:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-25 16:51:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-25 16:51:38,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-25 16:51:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:38,322 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-25 16:51:38,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-25 16:51:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 16:51:38,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:38,324 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:38,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:38,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:38,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:51:38,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-25 16:51:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:51:38,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753248712] [2022-11-25 16:51:38,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:51:38,543 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-11-25 16:51:38,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:51:38,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:51:38,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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 (4)] Waiting until timeout for monitored process [2022-11-25 16:51:38,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:51:38,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:51:38,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 16:51:38,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:42,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:52:09,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from false [2022-11-25 16:52:17,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-11-25 16:52:19,470 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-11-25 16:52:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 16:52:19,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:52:19,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753248712] [2022-11-25 16:52:19,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753248712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:52:19,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:52:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-25 16:52:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954181286] [2022-11-25 16:52:19,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:52:19,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 16:52:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:52:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 16:52:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=70, Unknown=6, NotChecked=38, Total=156 [2022-11-25 16:52:19,494 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:23,691 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 16:52:25,723 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 16:52:46,996 WARN L233 SmtUtils]: Spent 11.69s 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-11-25 16:52:49,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:52:57,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:52:59,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:53:03,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:53:06,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:53:07,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:53:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:08,193 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-25 16:53:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:53:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 16:53:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:08,209 INFO L225 Difference]: With dead ends: 19 [2022-11-25 16:53:08,209 INFO L226 Difference]: Without dead ends: 15 [2022-11-25 16:53:08,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=86, Invalid=132, Unknown=8, NotChecked=116, Total=342 [2022-11-25 16:53:08,211 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:08,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 4 Unknown, 21 Unchecked, 16.1s Time] [2022-11-25 16:53:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-25 16:53:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-25 16:53:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 16:53:08,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-11-25 16:53:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:08,218 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 16:53:08,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:53:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 16:53:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 16:53:08,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:08,219 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:08,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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 (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:53:08,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:53:08,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:53:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 3 times [2022-11-25 16:53:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:53:08,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297062366] [2022-11-25 16:53:08,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:53:08,422 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-11-25 16:53:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:53:08,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:53:08,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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 (5)] Waiting until timeout for monitored process [2022-11-25 16:53:09,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 16:53:09,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:53:09,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 16:53:09,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:41,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:55,642 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse1))) (or (fp.lt (fp.add c_currentRoundingMode .cse0 .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)) (not (fp.lt .cse0 .cse2)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from true [2022-11-25 16:54:13,865 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-25 16:54:32,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2022-11-25 16:54:34,461 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2022-11-25 16:54:53,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-25 16:54:55,121 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-25 16:55:13,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-25 16:55:15,879 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-25 16:55:34,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-25 16:55:36,764 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-25 16:55:55,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2022-11-25 16:55:57,803 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2022-11-25 16:55:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-25 16:55:57,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:55:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297062366] [2022-11-25 16:55:57,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297062366] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:57,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:57,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-25 16:55:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206872091] [2022-11-25 16:55:57,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:57,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 16:55:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:55:57,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 16:55:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=124, Unknown=21, NotChecked=210, Total=420 [2022-11-25 16:55:57,829 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:00,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:56:02,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:56:04,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:56:07,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:56:08,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:56:11,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 16:56:13,168 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 16:56:15,235 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse4 .cse4)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 16:56:18,427 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 16:56:22,323 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from true [2022-11-25 16:57:01,498 WARN L233 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:57:03,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 16:57:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:10,510 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-11-25 16:57:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:57:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 16:57:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:10,527 INFO L225 Difference]: With dead ends: 22 [2022-11-25 16:57:10,527 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 16:57:10,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 118.6s TimeCoverageRelationStatistics Valid=121, Invalid=203, Unknown=26, NotChecked=462, Total=812 [2022-11-25 16:57:10,529 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:10,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 3 Unknown, 99 Unchecked, 16.9s Time] [2022-11-25 16:57:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 16:57:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 16:57:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-25 16:57:10,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-11-25 16:57:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:10,537 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-25 16:57:10,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-25 16:57:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 16:57:10,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:10,538 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:10,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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 (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:57:10,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:57:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1060067472, now seen corresponding path program 4 times [2022-11-25 16:57:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:10,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066137815] [2022-11-25 16:57:10,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:57:10,753 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-11-25 16:57:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:10,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:57:10,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c0d0d3d-8986-4ef3-ab8b-fc174a0ab2d1/bin/uautomizer-ZsLfNo2U6R/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-11-25 16:57:13,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:57:13,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:13,670 WARN L261 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 16:57:13,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:33,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:59:13,236 WARN L233 SmtUtils]: Spent 9.40s 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-11-25 16:59:30,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from false [2022-11-25 16:59:32,657 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-25 16:59:55,476 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2022-11-25 16:59:57,529 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2022-11-25 17:00:24,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from false [2022-11-25 17:00:26,597 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from true [2022-11-25 17:00:58,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from false [2022-11-25 17:01:00,256 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from true [2022-11-25 17:01:36,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from false [2022-11-25 17:01:38,167 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from true [2022-11-25 17:02:18,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from false [2022-11-25 17:02:20,661 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from true [2022-11-25 17:03:05,492 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from false [2022-11-25 17:03:07,582 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from true [2022-11-25 17:03:56,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from false [2022-11-25 17:03:59,072 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from true [2022-11-25 17:04:53,088 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from false [2022-11-25 17:04:55,190 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from true [2022-11-25 17:04:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 63 not checked. [2022-11-25 17:04:55,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:04:55,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066137815] [2022-11-25 17:04:55,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066137815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:04:55,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:04:55,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-25 17:04:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180975963] [2022-11-25 17:04:55,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:04:55,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 17:04:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:04:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:04:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=199, Unknown=45, NotChecked=360, Total=702 [2022-11-25 17:04:55,248 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:04:57,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:04:59,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:02,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:04,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:06,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:09,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:11,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:14,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:05:16,254 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) (= |c_ULTIMATE.start_main_~x~0#1| .cse13) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:18,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0)) (let ((.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse17 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse18 (fp.sub c_currentRoundingMode .cse6 .cse0))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse18 .cse0)) (.cse9 (fp.add c_currentRoundingMode .cse17 .cse0))) (let ((.cse11 (fp.add c_currentRoundingMode .cse9 .cse0)) (.cse12 (fp.sub c_currentRoundingMode .cse10 .cse0))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse12 .cse0)) (.cse3 (fp.add c_currentRoundingMode .cse11 .cse0))) (let ((.cse15 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse16 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse0)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse13 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse14 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (fp.lt (fp.add c_currentRoundingMode .cse1 .cse0) (fp.sub c_currentRoundingMode .cse2 .cse0)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 17:05:20,436 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0)) (let ((.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse17 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse18 (fp.sub c_currentRoundingMode .cse6 .cse0))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse18 .cse0)) (.cse9 (fp.add c_currentRoundingMode .cse17 .cse0))) (let ((.cse11 (fp.add c_currentRoundingMode .cse9 .cse0)) (.cse12 (fp.sub c_currentRoundingMode .cse10 .cse0))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse12 .cse0)) (.cse3 (fp.add c_currentRoundingMode .cse11 .cse0))) (let ((.cse15 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse16 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse0)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse13 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse14 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (fp.lt (fp.add c_currentRoundingMode .cse1 .cse0) (fp.sub c_currentRoundingMode .cse2 .cse0)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:22,525 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse11 .cse11) .cse11) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse11) .cse11) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:24,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse3 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse13 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse14 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse14 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse13 .cse0))) (let ((.cse11 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse12 (fp.sub c_currentRoundingMode .cse8 .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse12 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse11 .cse0))) (let ((.cse9 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse10 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse9 .cse0) (fp.sub c_currentRoundingMode .cse10 .cse0)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 17:05:26,682 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse3 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse13 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse14 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse14 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse13 .cse0))) (let ((.cse11 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse12 (fp.sub c_currentRoundingMode .cse8 .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse12 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse11 .cse0))) (let ((.cse9 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse10 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse9 .cse0) (fp.sub c_currentRoundingMode .cse10 .cse0)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:28,764 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse8) .cse8) .cse8) .cse8) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 .cse8) .cse8) .cse8) .cse8)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:30,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse9 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse10 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse10 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse9 .cse0))) (let ((.cse7 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse8 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse7 .cse0) (fp.sub c_currentRoundingMode .cse8 .cse0)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 17:05:32,881 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse9 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse10 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse10 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse9 .cse0))) (let ((.cse7 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse8 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse7 .cse0) (fp.sub c_currentRoundingMode .cse8 .cse0)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:34,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0)) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 17:05:36,986 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0)) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:05:39,437 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-25 17:06:35,166 WARN L233 SmtUtils]: Spent 21.87s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:06:37,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []