./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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 15:49:12,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:49:12,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:49:12,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:49:12,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:49:12,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:49:12,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:49:12,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:49:12,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:49:12,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:49:12,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:49:12,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:49:12,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:49:12,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:49:12,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:49:12,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:49:12,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:49:13,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:49:13,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:49:13,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:49:13,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:49:13,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:49:13,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:49:13,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:49:13,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:49:13,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:49:13,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:49:13,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:49:13,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:49:13,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:49:13,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:49:13,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:49:13,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:49:13,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:49:13,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:49:13,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:49:13,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:49:13,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:49:13,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:49:13,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:49:13,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:49:13,048 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:49:13,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:49:13,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:49:13,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:49:13,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:49:13,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:49:13,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:49:13,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:49:13,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:49:13,095 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:49:13,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:49:13,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:49:13,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:49:13,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:49:13,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:49:13,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:49:13,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:49:13,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:49:13,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:49:13,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:49:13,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:49:13,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:49:13,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:49:13,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:49:13,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:49:13,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:49:13,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:49:13,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:49:13,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:49:13,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:49:13,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:49:13,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:49:13,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:49:13,102 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:49:13,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:49:13,103 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-25 15:49:13,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:49:13,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:49:13,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:49:13,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:49:13,454 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:49:13,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 15:49:16,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:49:16,639 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:49:16,640 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 15:49:16,646 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/81b4784b4/8353c8d5e80547c3999bbc1a6f96ee23/FLAG8a23342a0 [2022-11-25 15:49:16,671 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/81b4784b4/8353c8d5e80547c3999bbc1a6f96ee23 [2022-11-25 15:49:16,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:49:16,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:49:16,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:49:16,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:49:16,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:49:16,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:16,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b90a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16, skipping insertion in model container [2022-11-25 15:49:16,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:16,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:49:16,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:49:16,911 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 15:49:16,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:49:16,933 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:49:16,945 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 15:49:16,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:49:16,959 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:49:16,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16 WrapperNode [2022-11-25 15:49:16,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:49:16,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:49:16,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:49:16,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:49:16,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:16,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,001 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-25 15:49:17,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:49:17,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:49:17,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:49:17,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:49:17,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:49:17,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:49:17,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:49:17,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:49:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (1/1) ... [2022-11-25 15:49:17,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:49:17,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:49:17,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:49:17,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:49:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:49:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:49:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:49:17,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:49:17,207 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:49:17,209 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:49:17,342 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:49:17,350 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:49:17,350 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:49:17,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:49:17 BoogieIcfgContainer [2022-11-25 15:49:17,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:49:17,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:49:17,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:49:17,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:49:17,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:49:16" (1/3) ... [2022-11-25 15:49:17,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f02c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:49:17, skipping insertion in model container [2022-11-25 15:49:17,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:16" (2/3) ... [2022-11-25 15:49:17,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f02c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:49:17, skipping insertion in model container [2022-11-25 15:49:17,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:49:17" (3/3) ... [2022-11-25 15:49:17,363 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-25 15:49:17,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:49:17,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:49:17,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:49:17,444 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;@596aafb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:49:17,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:49:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 15:49:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:49:17,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:17,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:17,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-25 15:49:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:49:17,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600014482] [2022-11-25 15:49:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:49:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:17,627 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 15:49:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:49:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600014482] [2022-11-25 15:49:17,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600014482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:49:17,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:49:17,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:49:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944214140] [2022-11-25 15:49:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:49:17,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:49:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:49:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:49:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:49:17,668 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 15:49:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:17,681 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-25 15:49:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:49:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:49:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:17,689 INFO L225 Difference]: With dead ends: 30 [2022-11-25 15:49:17,689 INFO L226 Difference]: Without dead ends: 12 [2022-11-25 15:49:17,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:49:17,696 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:17,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:49:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-25 15:49:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 15:49:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:49:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-25 15:49:17,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-25 15:49:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:17,732 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-25 15:49:17,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 15:49:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-25 15:49:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:49:17,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:17,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:17,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:49:17,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-25 15:49:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:49:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072187387] [2022-11-25 15:49:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:49:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:49:17,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:49:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:49:17,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:49:17,787 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:49:17,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 15:49:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:49:17,795 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 15:49:17,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:49:17,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:49:17 BoogieIcfgContainer [2022-11-25 15:49:17,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:49:17,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:49:17,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:49:17,821 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:49:17,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:49:17" (3/4) ... [2022-11-25 15:49:17,825 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:49:17,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:49:17,826 INFO L158 Benchmark]: Toolchain (without parser) took 1147.21ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 85.9MB in the end (delta: 41.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,826 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 97.3MB in the beginning and 97.2MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:49:17,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.86ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 123.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.05ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,828 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 120.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,829 INFO L158 Benchmark]: RCFGBuilder took 305.53ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 109.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,829 INFO L158 Benchmark]: TraceAbstraction took 464.60ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 85.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 15:49:17,830 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:49:17,832 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.27ms. Allocated memory is still 130.0MB. Free memory was 97.3MB in the beginning and 97.2MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.86ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 123.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.05ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 120.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 305.53ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 109.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 464.60ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 85.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. 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: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [E0=53, i=0] [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:49:17,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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 15:49:20,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:49:20,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:49:20,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:49:20,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:49:20,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:49:20,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:49:20,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:49:20,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:49:20,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:49:20,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:49:20,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:49:20,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:49:20,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:49:20,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:49:20,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:49:20,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:49:20,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:49:20,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:49:20,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:49:20,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:49:20,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:49:20,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:49:20,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:49:20,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:49:20,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:49:20,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:49:20,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:49:20,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:49:20,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:49:20,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:49:20,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:49:20,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:49:20,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:49:20,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:49:20,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:49:20,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:49:20,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:49:20,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:49:20,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:49:20,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:49:20,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-25 15:49:20,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:49:20,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:49:20,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:49:20,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:49:20,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:49:20,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:49:20,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:49:20,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:49:20,415 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:49:20,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:49:20,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:49:20,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:49:20,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:49:20,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:49:20,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:49:20,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:49:20,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:49:20,417 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:49:20,417 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:49:20,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:49:20,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:49:20,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:49:20,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:49:20,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:49:20,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:49:20,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:49:20,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:49:20,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:49:20,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:49:20,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:49:20,420 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:49:20,421 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:49:20,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:49:20,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:49:20,422 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:49:20,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:49:20,422 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:49:20,422 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-25 15:49:20,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:49:20,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:49:20,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:49:20,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:49:20,795 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:49:20,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 15:49:23,862 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:49:24,028 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:49:24,029 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c [2022-11-25 15:49:24,035 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/5b8788eae/15bac3a0d9514774ac524eee3d7e0b61/FLAG1e83abd43 [2022-11-25 15:49:24,048 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/data/5b8788eae/15bac3a0d9514774ac524eee3d7e0b61 [2022-11-25 15:49:24,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:49:24,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:49:24,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:49:24,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:49:24,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:49:24,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de2636b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24, skipping insertion in model container [2022-11-25 15:49:24,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:49:24,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:49:24,228 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 15:49:24,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:49:24,259 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:49:24,273 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_6efb90f9-8761-4d4e-87fe-a58d425d7e25/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-25 15:49:24,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:49:24,292 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:49:24,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24 WrapperNode [2022-11-25 15:49:24,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:49:24,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:49:24,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:49:24,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:49:24,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,329 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-25 15:49:24,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:49:24,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:49:24,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:49:24,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:49:24,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:49:24,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:49:24,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:49:24,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:49:24,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (1/1) ... [2022-11-25 15:49:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:49:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:49:24,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:49:24,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:49:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:49:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:49:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:49:24,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:49:24,542 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:49:24,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:49:26,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:49:26,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:49:26,799 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:49:26,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:49:26 BoogieIcfgContainer [2022-11-25 15:49:26,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:49:26,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:49:26,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:49:26,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:49:26,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:49:24" (1/3) ... [2022-11-25 15:49:26,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6080f693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:49:26, skipping insertion in model container [2022-11-25 15:49:26,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:49:24" (2/3) ... [2022-11-25 15:49:26,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6080f693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:49:26, skipping insertion in model container [2022-11-25 15:49:26,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:49:26" (3/3) ... [2022-11-25 15:49:26,812 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-25 15:49:26,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:49:26,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:49:26,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:49:26,973 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;@422f716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:49:26,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:49:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 15:49:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:49:26,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:26,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:26,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-25 15:49:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:49:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279872555] [2022-11-25 15:49:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:27,024 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 15:49:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:49:27,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:27,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:49:27,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:49:27,171 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 15:49:27,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:49:27,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:49:27,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279872555] [2022-11-25 15:49:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279872555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:49:27,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:49:27,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:49:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380622396] [2022-11-25 15:49:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:49:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:49:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:49:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:49:27,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:49:27,229 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 15:49:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:27,246 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-25 15:49:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:49:27,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:49:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:27,263 INFO L225 Difference]: With dead ends: 30 [2022-11-25 15:49:27,264 INFO L226 Difference]: Without dead ends: 12 [2022-11-25 15:49:27,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:49:27,272 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:27,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:49:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-25 15:49:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 15:49:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:49:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-25 15:49:27,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-25 15:49:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:27,315 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-25 15:49:27,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 15:49:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-25 15:49:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:49:27,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:27,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:27,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-25 15:49:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:49:27,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251494078] [2022-11-25 15:49:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:27,544 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 15:49:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:49:27,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:27,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:49:27,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:49:27,788 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 15:49:27,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:49:27,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:49:27,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251494078] [2022-11-25 15:49:27,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251494078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:49:27,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:49:27,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:49:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573676161] [2022-11-25 15:49:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:49:27,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:49:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:49:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:49:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:49:27,793 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 15:49:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:29,297 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-25 15:49:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:49:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:49:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:29,299 INFO L225 Difference]: With dead ends: 28 [2022-11-25 15:49:29,299 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 15:49:29,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:49:29,301 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:29,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 15:49:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 15:49:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-11-25 15:49:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:49:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-25 15:49:29,306 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-25 15:49:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:29,306 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-25 15:49:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 15:49:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-25 15:49:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:49:29,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:29,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:29,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:29,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:29,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-11-25 15:49:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:49:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716377389] [2022-11-25 15:49:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:29,510 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 15:49:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:49:29,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:29,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:29,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:49:30,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:49:31,073 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 15:49:31,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:49:31,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:49:31,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716377389] [2022-11-25 15:49:31,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716377389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:49:31,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:49:31,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:49:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413539329] [2022-11-25 15:49:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:49:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:49:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:49:31,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:49:31,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:49:31,077 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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 15:49:34,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:49:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:34,887 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-25 15:49:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:49:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:49:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:34,888 INFO L225 Difference]: With dead ends: 31 [2022-11-25 15:49:34,907 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 15:49:34,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:49:34,909 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:34,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-11-25 15:49:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 15:49:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-11-25 15:49:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 15:49:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-25 15:49:34,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-11-25 15:49:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:34,919 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-25 15:49:34,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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 15:49:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-25 15:49:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:49:34,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:34,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:49:34,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:35,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:35,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:49:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-11-25 15:49:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:49:35,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524674684] [2022-11-25 15:49:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:35,144 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 15:49:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:49:35,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:35,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:49:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:35,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:49:35,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:50:03,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:50:16,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-25 15:50:18,514 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-25 15:50:41,511 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-25 15:50:43,556 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-25 15:51:10,514 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1))))))) is different from true [2022-11-25 15:52:50,334 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3)))))) is different from true [2022-11-25 15:53:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 15:53:44,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:53:44,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524674684] [2022-11-25 15:53:44,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524674684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:53:44,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:53:44,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-11-25 15:53:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749607025] [2022-11-25 15:53:44,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:53:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 15:53:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:53:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 15:53:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=147, Unknown=22, NotChecked=116, Total=342 [2022-11-25 15:53:44,485 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:46,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:53:48,521 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 [0] [2022-11-25 15:53:49,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:53:51,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:53:53,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:53:55,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:53:57,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:54:26,753 WARN L233 SmtUtils]: Spent 25.67s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:54:54,126 WARN L233 SmtUtils]: Spent 22.56s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:54:58,480 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2)) (.cse5 (fp.mul c_currentRoundingMode .cse9 .cse0)) (.cse4 (fp.neg .cse6)) (.cse8 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1)) (.cse3 (fp.mul c_currentRoundingMode .cse9 |c_ULTIMATE.start_main_~S~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) .cse7 (or (and .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse8) (and (or (not .cse8) (not .cse7)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) .cse8 (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-25 15:54:59,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:01,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:02,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:05,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:10,028 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2))) (let ((.cse4 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse5 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse0))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse2))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) .cse4 (or (and .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse5) (and (or (not .cse5) (not .cse4)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) .cse5 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2022-11-25 15:55:13,546 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-25 15:55:16,165 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-25 15:55:17,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:19,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:23,806 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse3)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse6 (fp.neg .cse7))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (or (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) .cse5) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse7) (or (let ((.cse8 (fp.mul c_currentRoundingMode .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))))) .cse5) (let ((.cse10 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse6)) (.cse9 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse7))) (or (and .cse9 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse10) (and (or (not .cse10) (not .cse9)) .cse5))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-25 15:55:25,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:34,251 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse3 (fp.neg .cse6)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse2 .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse2 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-25 15:55:36,335 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse3 (fp.neg .cse6)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse2 .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse2 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-25 15:55:38,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:55:56,603 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:55:58,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:56:00,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:56:03,704 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 (fp.neg .cse5))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse5) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse3)))) is different from true [2022-11-25 15:56:05,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:56:08,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:56:10,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:56:26,335 WARN L233 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:56:28,432 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from true [2022-11-25 15:56:30,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:56:32,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:56:34,743 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.neg .cse5)) (.cse7 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) .cse4)))) is different from false [2022-11-25 15:56:36,821 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.neg .cse5)) (.cse7 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) .cse4)))) is different from true [2022-11-25 15:56:38,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (fp.leq .cse0 .cse5)))) is different from false [2022-11-25 15:56:40,955 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (fp.leq .cse0 .cse5)))) is different from true [2022-11-25 15:56:43,635 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 (fp.neg .cse5))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse5) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse3)))) is different from true [2022-11-25 15:56:44,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:51,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:56:54,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:57:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:57:06,129 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-25 15:57:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 15:57:06,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:57:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:57:06,131 INFO L225 Difference]: With dead ends: 55 [2022-11-25 15:57:06,131 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 15:57:06,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 210.5s TimeCoverageRelationStatistics Valid=155, Invalid=419, Unknown=38, NotChecked=870, Total=1482 [2022-11-25 15:57:06,133 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:57:06,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 75 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 14 Unknown, 159 Unchecked, 55.8s Time] [2022-11-25 15:57:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 15:57:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 22. [2022-11-25 15:57:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:57:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-25 15:57:06,138 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-11-25 15:57:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:57:06,139 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-25 15:57:06,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:57:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-25 15:57:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:57:06,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:57:06,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:57:06,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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)] Ended with exit code 0 [2022-11-25 15:57:06,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:57:06,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:57:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:57:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1185630247, now seen corresponding path program 1 times [2022-11-25 15:57:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:57:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162074697] [2022-11-25 15:57:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:57:06,342 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 15:57:06,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:57:06,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:57:06,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6efb90f9-8761-4d4e-87fe-a58d425d7e25/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 15:57:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:57:07,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:57:07,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:57:39,257 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) |ULTIMATE.start_main_~E1~0#1|) .cse2)))) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 15:59:22,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse6)) (.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (or (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|))) (and (fp.leq .cse7 .cse6) (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2022-11-25 15:59:54,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from false [2022-11-25 15:59:56,150 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from true [2022-11-25 15:59:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 15:59:56,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:00:06,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-25 16:00:09,056 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-25 16:00:30,936 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-25 16:00:33,001 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-25 16:01:00,106 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-11-25 16:02:16,633 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-11-25 16:02:44,113 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse1))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) (not (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse4)) (not (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse1))))) is different from true [2022-11-25 16:03:21,716 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5))))) is different from false [2022-11-25 16:03:23,872 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5))))) is different from true [2022-11-25 16:04:41,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-25 16:04:43,236 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse5)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse4 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (not (fp.leq .cse0 .cse5)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from true