./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:05:13,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:05:13,563 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:05:13,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:05:13,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:05:13,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:05:13,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:05:13,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:05:13,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:05:13,605 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:05:13,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:05:13,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:05:13,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:05:13,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:05:13,608 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:05:13,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:05:13,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:05:13,609 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:05:13,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:05:13,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:05:13,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:05:13,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:05:13,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:05:13,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:05:13,613 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:05:13,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:05:13,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:05:13,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:05:13,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:05:13,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:05:13,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:05:13,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:13,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:05:13,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:05:13,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:05:13,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:05:13,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:05:13,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:05:13,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:05:13,633 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:05:13,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:05:13,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:05:13,634 INFO L153 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2023-11-29 07:05:13,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:05:13,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:05:13,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:05:13,898 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:05:13,898 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:05:13,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-11-29 07:05:16,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:05:16,769 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:05:16,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-11-29 07:05:16,776 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/822c5dd23/07779b619a5b49aaa334ba3cac275529/FLAG08d68cdde [2023-11-29 07:05:16,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/822c5dd23/07779b619a5b49aaa334ba3cac275529 [2023-11-29 07:05:16,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:05:16,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:05:16,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:16,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:05:16,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:05:16,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:16" (1/1) ... [2023-11-29 07:05:16,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72874ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:16, skipping insertion in model container [2023-11-29 07:05:16,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:16" (1/1) ... [2023-11-29 07:05:16,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:05:16,963 WARN L240 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-11-29 07:05:16,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:16,992 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:05:17,005 WARN L240 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-11-29 07:05:17,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:17,030 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:05:17,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17 WrapperNode [2023-11-29 07:05:17,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:17,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:17,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:05:17,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:05:17,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,070 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2023-11-29 07:05:17,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:17,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:05:17,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:05:17,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:05:17,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,101 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-11-29 07:05:17,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:05:17,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:05:17,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:05:17,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:05:17,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (1/1) ... [2023-11-29 07:05:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:05:17,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:05:17,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:05:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:05:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:05:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:05:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:05:17,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 07:05:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 07:05:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 07:05:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:05:17,252 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:05:17,254 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:05:17,381 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:05:17,408 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:05:17,408 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:05:17,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:17 BoogieIcfgContainer [2023-11-29 07:05:17,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:05:17,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:05:17,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:05:17,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:05:17,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:05:16" (1/3) ... [2023-11-29 07:05:17,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdbdc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:17, skipping insertion in model container [2023-11-29 07:05:17,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:17" (2/3) ... [2023-11-29 07:05:17,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdbdc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:17, skipping insertion in model container [2023-11-29 07:05:17,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:17" (3/3) ... [2023-11-29 07:05:17,417 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2023-11-29 07:05:17,433 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:05:17,433 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:05:17,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:05:17,478 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=LoopHeads, 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;@5df87dab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:05:17,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:05:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 07:05:17,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:17,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:17,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:17,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash 190800760, now seen corresponding path program 1 times [2023-11-29 07:05:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778780321] [2023-11-29 07:05:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:05:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778780321] [2023-11-29 07:05:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778780321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:05:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841006272] [2023-11-29 07:05:17,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:17,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:05:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:05:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:17,683 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2023-11-29 07:05:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:17,702 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-11-29 07:05:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:05:17,704 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 [2023-11-29 07:05:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:17,712 INFO L225 Difference]: With dead ends: 24 [2023-11-29 07:05:17,712 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 07:05:17,715 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 [2023-11-29 07:05:17,718 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:17,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 07:05:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-29 07:05:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-29 07:05:17,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-11-29 07:05:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:17,748 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-29 07:05:17,748 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) [2023-11-29 07:05:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-29 07:05:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 07:05:17,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:17,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:17,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:05:17,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:17,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -618665030, now seen corresponding path program 1 times [2023-11-29 07:05:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:17,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636480864] [2023-11-29 07:05:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:05:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636480864] [2023-11-29 07:05:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636480864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:05:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552491818] [2023-11-29 07:05:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:05:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:05:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:05:17,897 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2023-11-29 07:05:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:17,913 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-11-29 07:05:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:05:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2023-11-29 07:05:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:17,915 INFO L225 Difference]: With dead ends: 16 [2023-11-29 07:05:17,915 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 07:05:17,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:05:17,917 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:17,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 07:05:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 07:05:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 07:05:17,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-11-29 07:05:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:17,923 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 07:05:17,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2023-11-29 07:05:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 07:05:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 07:05:17,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:17,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:17,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:05:17,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:17,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1997659876, now seen corresponding path program 1 times [2023-11-29 07:05:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073111547] [2023-11-29 07:05:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:05:17,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:05:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:05:18,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:05:18,020 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:05:18,021 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 07:05:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:05:18,025 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 07:05:18,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:05:18,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 07:05:18,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-29 07:05:18,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:05:18 BoogieIcfgContainer [2023-11-29 07:05:18,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:05:18,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:05:18,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:05:18,051 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:05:18,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:17" (3/4) ... [2023-11-29 07:05:18,053 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:05:18,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:05:18,054 INFO L158 Benchmark]: Toolchain (without parser) took 1262.30ms. Allocated memory is still 188.7MB. Free memory was 159.4MB in the beginning and 91.1MB in the end (delta: 68.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,055 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:05:18,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.07ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 147.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 188.7MB. Free memory was 147.9MB in the beginning and 146.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,056 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 188.7MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,057 INFO L158 Benchmark]: RCFGBuilder took 294.28ms. Allocated memory is still 188.7MB. Free memory was 144.3MB in the beginning and 131.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,057 INFO L158 Benchmark]: TraceAbstraction took 638.39ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 91.3MB in the end (delta: 39.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-29 07:05:18,058 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 188.7MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:05:18,061 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.07ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 147.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 188.7MB. Free memory was 147.9MB in the beginning and 146.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 188.7MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.28ms. Allocated memory is still 188.7MB. Free memory was 144.3MB in the beginning and 131.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 638.39ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 91.3MB in the end (delta: 39.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 188.7MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] EXPR A_u.i & 0x7FF0000000000000 VAL [A=9214364837600034832, A_u={5:0}, \old(A)=9214364837600034832, xi_u={4:0}] [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [A=9214364837600034832, A_u={5:0}, \old(A)=9214364837600034832, cond=1, exp=-1023, xi=9214364837600034830, xi_u={4:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [A=9214364837600034832, A_u={5:0}, \old(A)=9214364837600034832, cond=0, exp=-1023, xi=9214364837600034831, xi_u={4:0}, xsi=9214364837600034831] [L35] COND FALSE !(\read(cond)) VAL [A=9214364837600034832, A_u={5:0}, \old(A)=9214364837600034832, cond=0, exp=-1023, xi=9214364837600034831, xi_u={4:0}, xsi=9214364837600034831] [L41] return xi; [L41] return xi; [L41] return xi; [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, 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, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 22 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2023-11-29 07:05:18,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:05:20,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:05:20,091 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:05:20,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:05:20,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:05:20,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:05:20,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:05:20,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:05:20,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:05:20,143 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:05:20,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:05:20,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:05:20,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:05:20,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:05:20,146 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:05:20,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:05:20,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:05:20,147 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:05:20,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:05:20,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:05:20,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:05:20,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:05:20,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:05:20,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:05:20,151 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:05:20,152 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:05:20,152 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:05:20,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:05:20,153 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:05:20,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:05:20,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:05:20,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:05:20,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:05:20,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:20,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:05:20,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:05:20,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:05:20,156 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:05:20,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:05:20,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:05:20,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:05:20,157 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:05:20,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:05:20,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:05:20,157 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:05:20,157 INFO L153 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2023-11-29 07:05:20,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:05:20,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:05:20,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:05:20,472 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:05:20,472 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:05:20,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-11-29 07:05:23,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:05:23,510 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:05:23,511 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-11-29 07:05:23,519 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/47e0902b0/2e920dd200e542f98e8b29a1d0a4886f/FLAG45379d25a [2023-11-29 07:05:23,535 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/data/47e0902b0/2e920dd200e542f98e8b29a1d0a4886f [2023-11-29 07:05:23,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:05:23,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:05:23,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:23,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:05:23,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:05:23,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c63aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23, skipping insertion in model container [2023-11-29 07:05:23,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:05:23,727 WARN L240 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-11-29 07:05:23,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:23,761 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:05:23,774 WARN L240 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_9d99da95-a0d3-4fb4-b543-b70be414b2bf/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-11-29 07:05:23,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:23,804 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:05:23,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23 WrapperNode [2023-11-29 07:05:23,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:23,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:23,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:05:23,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:05:23,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,845 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2023-11-29 07:05:23,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:23,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:05:23,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:05:23,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:05:23,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,878 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-11-29 07:05:23,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:05:23,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:05:23,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:05:23,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:05:23,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (1/1) ... [2023-11-29 07:05:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:05:23,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:05:23,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:05:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:05:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 07:05:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 07:05:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-29 07:05:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 07:05:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 07:05:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-29 07:05:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-11-29 07:05:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-11-29 07:05:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:05:23,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:05:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-11-29 07:05:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-11-29 07:05:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-11-29 07:05:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:05:24,068 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:05:24,070 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:05:28,343 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:05:28,370 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:05:28,370 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:05:28,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:28 BoogieIcfgContainer [2023-11-29 07:05:28,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:05:28,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:05:28,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:05:28,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:05:28,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:05:23" (1/3) ... [2023-11-29 07:05:28,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb6e537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:28, skipping insertion in model container [2023-11-29 07:05:28,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:23" (2/3) ... [2023-11-29 07:05:28,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb6e537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:28, skipping insertion in model container [2023-11-29 07:05:28,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:28" (3/3) ... [2023-11-29 07:05:28,390 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2023-11-29 07:05:28,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:05:28,412 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:05:28,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:05:28,478 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=LoopHeads, 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;@260c459, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:05:28,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:05:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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) [2023-11-29 07:05:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 07:05:28,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:28,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:28,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:28,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1259772761, now seen corresponding path program 1 times [2023-11-29 07:05:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:28,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367553136] [2023-11-29 07:05:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:28,507 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 [2023-11-29 07:05:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:28,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 07:05:28,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:05:28,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:05:28,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:05:28,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:28,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367553136] [2023-11-29 07:05:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367553136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:28,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:05:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864009270] [2023-11-29 07:05:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:28,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:05:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:05:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:28,698 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:28,746 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-11-29 07:05:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:05:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 07:05:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:28,755 INFO L225 Difference]: With dead ends: 18 [2023-11-29 07:05:28,755 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 07:05:28,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:28,762 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:28,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 07:05:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 07:05:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 07:05:28,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-11-29 07:05:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:28,788 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 07:05:28,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 07:05:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 07:05:28,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:28,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:28,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:28,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:28,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1202514459, now seen corresponding path program 1 times [2023-11-29 07:05:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562354899] [2023-11-29 07:05:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:28,992 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 [2023-11-29 07:05:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:28,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 07:05:28,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:05:29,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:05:29,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:05:29,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562354899] [2023-11-29 07:05:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562354899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:29,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:29,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:05:29,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36964256] [2023-11-29 07:05:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:29,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:05:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:05:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:05:29,146 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:33,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:05:37,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:05:41,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:05:41,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:41,827 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-11-29 07:05:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:05:41,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 07:05:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:41,828 INFO L225 Difference]: With dead ends: 13 [2023-11-29 07:05:41,828 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 07:05:41,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:05:41,830 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:41,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2023-11-29 07:05:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 07:05:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-29 07:05:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2023-11-29 07:05:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-29 07:05:41,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-29 07:05:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:41,835 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-29 07:05:41,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:05:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-29 07:05:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:05:41,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:41,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:41,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:05:42,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:42,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:42,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1377844293, now seen corresponding path program 1 times [2023-11-29 07:05:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610465146] [2023-11-29 07:05:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:42,039 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 [2023-11-29 07:05:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:42,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 07:05:42,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:05:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:42,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 07:05:42,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:51,939 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:00,284 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:08,600 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:16,898 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:25,302 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:33,779 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:42,103 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:50,494 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:58,784 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:07,193 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:15,544 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:23,955 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:32,291 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:40,650 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:49,059 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:07:57,401 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:01,673 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) .cse1)))) (and (= .cse0 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) .cse2))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse8 .cse6) (fp.leq .cse8 .cse7) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse10) .cse10)))) (and (fp.gt (fp.sub c_currentRoundingMode .cse9 .cse10) .cse11) (= .cse9 |c_ULTIMATE.start_inv_~xi~0#1|))))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))) (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse16 (let ((.cse17 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))))) (let ((.cse14 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse16) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse15 .cse16) .cse16)))) (let ((.cse13 (fp.sub c_currentRoundingMode .cse14 .cse16))) (and (not (fp.gt .cse13 .cse11)) (not (fp.lt .cse13 .cse2)) (= .cse14 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse15 .cse6) (fp.leq .cse15 .cse7)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:08:10,136 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:18,474 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:26,838 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:35,185 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:43,526 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:08:47,624 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:08:56,050 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:04,501 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:13,188 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:21,626 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:30,069 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:41,316 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:49,691 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:09:58,060 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:10:14,774 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:10:23,218 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:10:35,729 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:10:44,098 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:10:52,463 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:04,980 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:13,422 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:21,911 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:30,366 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:38,727 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:11:43,000 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse1 (fp.neg .cse4)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse8 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse8)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.lt .cse0 .cse1)) (fp.geq .cse2 .cse3) (not (fp.gt .cse0 .cse4)) (fp.leq .cse2 .cse5) (fp.leq .cse6 .cse7)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse12 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse11 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse12) .cse12)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse11 .cse12) .cse1)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.geq .cse13 .cse3) (fp.leq .cse13 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse18 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse17 (let ((.cse19 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (let ((.cse15 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse17) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 .cse17) .cse17)))) (let ((.cse16 (fp.sub roundNearestTiesToEven .cse15 .cse17))) (and (not (fp.leq .cse15 .cse7)) (not (fp.lt .cse16 .cse1)) (not (fp.gt .cse16 .cse4))))))) (fp.geq .cse18 .cse3) (fp.leq .cse18 .cse5))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2023-11-29 07:11:55,519 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:03,919 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:16,454 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:24,839 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:33,221 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:37,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse10)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) .cse2)) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse8 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (let ((.cse9 (fp.sub roundNearestTiesToEven .cse8 .cse11))) (and (not (fp.leq .cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.lt .cse9 .cse2)) (not (fp.gt .cse9 .cse10))))))) (fp.geq .cse12 .cse6) (fp.leq .cse12 .cse7))))))) is different from false [2023-11-29 07:12:41,510 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse10)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) .cse2)) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse8 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (let ((.cse9 (fp.sub roundNearestTiesToEven .cse8 .cse11))) (and (not (fp.leq .cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.lt .cse9 .cse2)) (not (fp.gt .cse9 .cse10))))))) (fp.geq .cse12 .cse6) (fp.leq .cse12 .cse7))))))) is different from true [2023-11-29 07:12:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 07:12:41,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:12:50,632 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:12:59,024 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:07,487 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:15,871 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:19,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2023-11-29 07:13:24,065 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2023-11-29 07:13:32,872 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:41,387 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:49,970 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:13:58,392 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:07,054 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:15,557 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:29,052 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:37,532 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:46,903 WARN L293 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:14:55,397 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:04,081 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:08,802 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse10 .cse11))) (or (fp.gt .cse9 .cse2) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.lt .cse9 .cse3)))))))))))) is different from true [2023-11-29 07:15:17,417 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:26,015 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:34,518 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:42,998 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:15:51,504 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:16:00,139 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:16:04,365 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse10 .cse11))) (or (fp.gt .cse9 .cse2) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.lt .cse9 .cse3)))))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-11-29 07:16:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 07:16:04,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:16:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610465146] [2023-11-29 07:16:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610465146] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:16:04,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:16:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-11-29 07:16:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142332317] [2023-11-29 07:16:04,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:16:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 07:16:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:16:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 07:16:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=47, Unknown=9, NotChecked=126, Total=210 [2023-11-29 07:16:04,368 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 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) [2023-11-29 07:16:08,717 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse0 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse0 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (not .cse1) (not .cse0)) .cse2))) (or (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse7 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse9 .cse7) .cse7)))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse3 .cse7))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse4 .cse5) (fp.lt .cse4 .cse6)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse9))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse11)) (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse14 (let ((.cse15 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (let ((.cse13 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse14) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse11 .cse14) .cse14)))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse13 .cse14))) (or (fp.gt .cse12 .cse5) (fp.leq .cse13 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.lt .cse12 .cse6)))))))))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 07:16:12,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse10 .cse11))) (or (fp.gt .cse9 .cse2) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.lt .cse9 .cse3))))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 07:16:16,984 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse10 .cse11))) (or (fp.gt .cse9 .cse2) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.lt .cse9 .cse3))))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 07:16:21,100 WARN L854 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (and (= (let ((.cse3 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_inv_~xi~0#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:16:25,213 WARN L876 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (and (= (let ((.cse3 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_inv_~xi~0#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 07:16:29,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)))) (and (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) .cse1)))) (and (= .cse0 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) .cse2))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse8 .cse6) (fp.leq .cse8 .cse7) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse10) .cse10)))) (and (fp.gt (fp.sub c_currentRoundingMode .cse9 .cse10) .cse11) (= .cse9 |c_ULTIMATE.start_inv_~xi~0#1|))))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))) (and .cse13 (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse17 (let ((.cse18 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18))))) (let ((.cse15 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse17) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse16 .cse17) .cse17)))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse15 .cse17))) (and (not (fp.gt .cse14 .cse11)) (not (fp.lt .cse14 .cse2)) (= .cse15 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse16 .cse6) (fp.leq .cse16 .cse7)))))))))) (or (and (fp.geq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))) (not .cse13)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 07:16:33,624 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:16:37,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (and (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse1 (fp.neg .cse4)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse8 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse8)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.lt .cse0 .cse1)) (fp.geq .cse2 .cse3) (not (fp.gt .cse0 .cse4)) (fp.leq .cse2 .cse5) (fp.leq .cse6 .cse7)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse12 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse11 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse12) .cse12)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse11 .cse12) .cse1)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.geq .cse13 .cse3) (fp.leq .cse13 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse18 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse17 (let ((.cse19 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (let ((.cse15 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse17) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 .cse17) .cse17)))) (let ((.cse16 (fp.sub roundNearestTiesToEven .cse15 .cse17))) (and (not (fp.leq .cse15 .cse7)) (not (fp.lt .cse16 .cse1)) (not (fp.gt .cse16 .cse4))))))) (fp.geq .cse18 .cse3) (fp.leq .cse18 .cse5))))) .cse20)))) (not .cse20))) is different from false [2023-11-29 07:16:42,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:16:46,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 07:16:50,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:16:54,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:16:58,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:16:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:16:58,410 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-29 07:16:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:16:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 07:16:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:16:58,411 INFO L225 Difference]: With dead ends: 14 [2023-11-29 07:16:58,411 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 07:16:58,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=40, Invalid=51, Unknown=17, NotChecked=312, Total=420 [2023-11-29 07:16:58,414 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:16:58,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 5 Unknown, 107 Unchecked, 20.7s Time] [2023-11-29 07:16:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 07:16:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 07:16:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:16:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-29 07:16:58,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-29 07:16:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:16:58,419 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-29 07:16:58,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 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) [2023-11-29 07:16:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-29 07:16:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 07:16:58,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:16:58,420 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:16:58,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 07:16:58,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:16:58,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:16:58,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:16:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash -235413019, now seen corresponding path program 2 times [2023-11-29 07:16:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:16:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451246] [2023-11-29 07:16:58,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:16:58,622 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 [2023-11-29 07:16:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:16:58,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 07:16:58,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d99da95-a0d3-4fb4-b543-b70be414b2bf/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 07:17:01,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:17:01,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:17:01,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 07:17:01,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:17:10,257 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:17:17,147 WARN L293 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:17:21,296 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (let ((.cse0 (let ((.cse1 (let ((.cse2 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| .cse0) .cse0))) |c_ULTIMATE.start_inv_~xi~0#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) |c_ULTIMATE.start_inv_~A#1|))) (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:17:30,241 WARN L293 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:17:39,281 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:17:48,209 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:17:57,171 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:06,277 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:15,201 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:24,164 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:33,114 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:42,139 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:51,142 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:00,071 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:09,276 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:18,224 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:22,939 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse13 (fp.neg .cse2)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)) (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse1 (let ((.cse7 (let ((.cse8 (let ((.cse9 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse1)))) (and (fp.gt (fp.sub c_currentRoundingMode .cse0 .cse1) .cse2) (fp.leq .cse3 .cse4) (fp.geq .cse3 .cse5) (= .cse0 |c_ULTIMATE.start_inv_~xi~0#1|)))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse12 (let ((.cse14 (let ((.cse15 (let ((.cse16 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse14) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse14) .cse14))))) (let ((.cse11 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse12) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse12) .cse12)))) (and (fp.leq .cse10 .cse4) (fp.geq .cse10 .cse5) (fp.lt (fp.sub c_currentRoundingMode .cse11 .cse12) .cse13) (= .cse11 |c_ULTIMATE.start_inv_~xi~0#1|)))))))) (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse18 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))))) (fp ((_ extract 63 63) .cse22) ((_ extract 62 52) .cse22) ((_ extract 51 0) .cse22))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse21) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse18 .cse21) .cse21))))) (let ((.cse19 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse20) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse18 .cse20) .cse20)))) (let ((.cse17 (fp.sub c_currentRoundingMode .cse19 .cse20))) (and (not (fp.lt .cse17 .cse13)) (fp.leq .cse18 .cse4) (fp.geq .cse18 .cse5) (not (fp.gt .cse17 .cse2)) (= .cse19 |c_ULTIMATE.start_inv_~xi~0#1|))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:19:32,101 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:41,243 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:50,330 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:19:59,402 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:20:08,489 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:20:12,721 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse6) .cse6))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (= .cse3 |c_ULTIMATE.start_inv_~xi~0#1|))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 07:20:30,283 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:20:39,336 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)