./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX --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.5-dev-a016563 [2024-11-08 16:48:58,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:48:58,378 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:48:58,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:48:58,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:48:58,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:48:58,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:48:58,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:48:58,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:48:58,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:48:58,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:48:58,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:48:58,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:48:58,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:48:58,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:48:58,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:48:58,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:48:58,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:48:58,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:48:58,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:48:58,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:48:58,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:48:58,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:48:58,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:48:58,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:48:58,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:48:58,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:48:58,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:48:58,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:48:58,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:48:58,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:48:58,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:48:58,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:48:58,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:48:58,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:48:58,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:48:58,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:48:58,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:48:58,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:48:58,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:48:58,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:48:58,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:48:58,452 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_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX 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 [2024-11-08 16:48:58,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:48:58,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:48:58,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:48:58,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:48:58,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:48:58,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c Unable to find full path for "g++" [2024-11-08 16:49:00,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:49:00,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:49:00,985 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-08 16:49:00,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/e13ece449/113a079a5d054fa4a5830e41bab0de0b/FLAGd336b5989 [2024-11-08 16:49:01,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/e13ece449/113a079a5d054fa4a5830e41bab0de0b [2024-11-08 16:49:01,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:49:01,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:49:01,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:01,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:49:01,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:49:01,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304e9a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01, skipping insertion in model container [2024-11-08 16:49:01,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:49:01,549 WARN L250 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_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-08 16:49:01,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:01,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:49:01,592 WARN L250 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_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-08 16:49:01,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:01,617 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:49:01,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01 WrapperNode [2024-11-08 16:49:01,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:01,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:01,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:49:01,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:49:01,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,657 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-11-08 16:49:01,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:01,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:49:01,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:49:01,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:49:01,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,684 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]. [2024-11-08 16:49:01,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:49:01,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:49:01,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:49:01,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:49:01,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (1/1) ... [2024-11-08 16:49:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:49:01,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:49:01,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:49:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 16:49:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 16:49:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:49:01,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:49:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:49:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:49:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:49:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:49:01,907 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:49:01,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:49:02,070 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 16:49:02,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:49:02,090 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:49:02,090 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:49:02,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:02 BoogieIcfgContainer [2024-11-08 16:49:02,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:49:02,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:49:02,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:49:02,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:49:02,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:49:01" (1/3) ... [2024-11-08 16:49:02,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c43e140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:02, skipping insertion in model container [2024-11-08 16:49:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:01" (2/3) ... [2024-11-08 16:49:02,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c43e140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:02, skipping insertion in model container [2024-11-08 16:49:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:02" (3/3) ... [2024-11-08 16:49:02,100 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2024-11-08 16:49:02,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:49:02,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:49:02,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:49:02,200 INFO L333 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, 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;@15cd8abf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:49:02,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:49:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:49:02,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:02,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:02,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:02,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 515648436, now seen corresponding path program 1 times [2024-11-08 16:49:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200430402] [2024-11-08 16:49:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:49:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200430402] [2024-11-08 16:49:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200430402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:02,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:02,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:49:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678630937] [2024-11-08 16:49:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:02,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:49:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:49:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:49:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:49:02,473 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:02,485 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-11-08 16:49:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:49:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 16:49:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:02,513 INFO L225 Difference]: With dead ends: 35 [2024-11-08 16:49:02,513 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 16:49:02,517 INFO L431 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 [2024-11-08 16:49:02,521 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:02,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:49:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 16:49:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 16:49:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2024-11-08 16:49:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-08 16:49:02,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2024-11-08 16:49:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-08 16:49:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-08 16:49:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:49:02,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:02,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:49:02,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1195706806, now seen corresponding path program 1 times [2024-11-08 16:49:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191563123] [2024-11-08 16:49:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:49:02,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191563123] [2024-11-08 16:49:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191563123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:02,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:02,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:49:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957222662] [2024-11-08 16:49:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:02,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:49:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:49:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:49:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:49:02,884 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:02,908 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-08 16:49:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:49:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 16:49:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:02,910 INFO L225 Difference]: With dead ends: 22 [2024-11-08 16:49:02,910 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 16:49:02,910 INFO L431 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 [2024-11-08 16:49:02,912 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:02,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:49:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 16:49:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-08 16:49:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-08 16:49:02,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-11-08 16:49:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-08 16:49:02,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:49:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-08 16:49:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:49:02,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:02,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:49:02,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 282050897, now seen corresponding path program 1 times [2024-11-08 16:49:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120458510] [2024-11-08 16:49:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:49:02,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:49:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:49:03,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:49:03,049 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:49:03,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:49:03,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:49:03,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 16:49:03,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:49:03,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:49:03 BoogieIcfgContainer [2024-11-08 16:49:03,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:49:03,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:49:03,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:49:03,084 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:49:03,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:02" (3/4) ... [2024-11-08 16:49:03,087 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:49:03,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:49:03,090 INFO L158 Benchmark]: Toolchain (without parser) took 1783.69ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 105.3MB in the beginning and 128.0MB in the end (delta: -22.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-08 16:49:03,090 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:49:03,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.05ms. Allocated memory is still 136.3MB. Free memory was 105.0MB in the beginning and 91.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:49:03,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.23ms. Allocated memory is still 136.3MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:49:03,092 INFO L158 Benchmark]: Boogie Preprocessor took 54.15ms. Allocated memory is still 136.3MB. Free memory was 90.5MB in the beginning and 88.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:49:03,092 INFO L158 Benchmark]: RCFGBuilder took 378.37ms. Allocated memory is still 136.3MB. Free memory was 88.2MB in the beginning and 75.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:49:03,093 INFO L158 Benchmark]: TraceAbstraction took 989.02ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 74.7MB in the beginning and 129.0MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:49:03,094 INFO L158 Benchmark]: Witness Printer took 5.55ms. Allocated memory is still 180.4MB. Free memory was 129.0MB in the beginning and 128.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:49:03,097 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.31ms. Allocated memory is still 136.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.05ms. Allocated memory is still 136.3MB. Free memory was 105.0MB in the beginning and 91.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.23ms. Allocated memory is still 136.3MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.15ms. Allocated memory is still 136.3MB. Free memory was 90.5MB in the beginning and 88.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.37ms. Allocated memory is still 136.3MB. Free memory was 88.2MB in the beginning and 75.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 989.02ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 74.7MB in the beginning and 129.0MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.55ms. Allocated memory is still 180.4MB. Free memory was 129.0MB in the beginning and 128.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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) [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 [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 [cond=1, xi=9214364837600034831] [L35] COND FALSE !(\read(cond)) VAL [cond=1, xi=9214364837600034831] [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 [cond=0, xi=9214364837600034830] [L35] COND TRUE \read(cond) VAL [xi=9214364837600034830] [L41] return xi; [L41] return xi; [L41] return xi; VAL [\result=9214364837600034830] [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 38 mSDtfsCounter, 8 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=19occurred 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.3s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 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 [2024-11-08 16:49:03,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX --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.5-dev-a016563 [2024-11-08 16:49:05,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:49:05,639 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:49:05,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:49:05,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:49:05,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:49:05,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:49:05,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:49:05,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:49:05,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:49:05,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:49:05,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:49:05,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:49:05,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:49:05,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:49:05,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:49:05,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:49:05,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:49:05,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:49:05,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:49:05,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:49:05,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:49:05,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:49:05,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:49:05,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:49:05,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:49:05,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:49:05,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:49:05,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:49:05,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:49:05,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:49:05,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:49:05,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:49:05,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:49:05,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:05,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:49:05,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:49:05,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:49:05,706 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:49:05,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:49:05,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:49:05,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:49:05,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:49:05,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:49:05,708 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_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX 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 [2024-11-08 16:49:06,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:49:06,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:49:06,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:49:06,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:49:06,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:49:06,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c Unable to find full path for "g++" [2024-11-08 16:49:08,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:49:08,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:49:08,454 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-08 16:49:08,464 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/ad153a4d3/44ad8a419d7945e3af626a87d19d2a24/FLAGccbe25a29 [2024-11-08 16:49:08,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/data/ad153a4d3/44ad8a419d7945e3af626a87d19d2a24 [2024-11-08 16:49:08,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:49:08,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:49:08,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:08,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:49:08,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:49:08,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9838db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08, skipping insertion in model container [2024-11-08 16:49:08,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:49:08,758 WARN L250 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_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-08 16:49:08,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:08,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:49:08,851 WARN L250 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_534987dd-12f9-4cae-aca7-f614189b884a/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-08 16:49:08,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:08,901 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:49:08,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08 WrapperNode [2024-11-08 16:49:08,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:08,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:08,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:49:08,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:49:08,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,953 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2024-11-08 16:49:08,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:08,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:49:08,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:49:08,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:49:08,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,990 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]. [2024-11-08 16:49:08,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:08,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:49:09,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:49:09,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:49:09,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:49:09,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (1/1) ... [2024-11-08 16:49:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:09,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:49:09,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:49:09,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:49:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:49:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:49:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:49:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 16:49:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:49:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:49:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 16:49:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-11-08 16:49:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-11-08 16:49:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:49:09,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:49:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2024-11-08 16:49:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2024-11-08 16:49:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2024-11-08 16:49:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:49:09,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:49:09,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:49:13,547 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 16:49:13,548 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:49:13,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:49:13,563 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:49:13,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:13 BoogieIcfgContainer [2024-11-08 16:49:13,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:49:13,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:49:13,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:49:13,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:49:13,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:49:08" (1/3) ... [2024-11-08 16:49:13,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373bd5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:13, skipping insertion in model container [2024-11-08 16:49:13,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:08" (2/3) ... [2024-11-08 16:49:13,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373bd5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:13, skipping insertion in model container [2024-11-08 16:49:13,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:13" (3/3) ... [2024-11-08 16:49:13,576 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2024-11-08 16:49:13,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:49:13,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:49:13,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:49:13,661 INFO L333 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, 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;@3ba0e47c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:49:13,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:49:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 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) [2024-11-08 16:49:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 16:49:13,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:13,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:13,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -586496911, now seen corresponding path program 1 times [2024-11-08 16:49:13,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:49:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399637376] [2024-11-08 16:49:13,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:13,696 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 [2024-11-08 16:49:13,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:49:13,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 16:49:13,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:49:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:13,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:49:13,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:13,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:13,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:49:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399637376] [2024-11-08 16:49:13,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399637376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:13,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:49:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877852414] [2024-11-08 16:49:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:13,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:49:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:49:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:49:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:49:13,946 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 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) [2024-11-08 16:49:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:13,960 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-08 16:49:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:49:13,963 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 [2024-11-08 16:49:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:13,971 INFO L225 Difference]: With dead ends: 27 [2024-11-08 16:49:13,971 INFO L226 Difference]: Without dead ends: 11 [2024-11-08 16:49:13,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:49:13,980 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:13,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:49:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-08 16:49:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-08 16:49:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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) [2024-11-08 16:49:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-08 16:49:14,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2024-11-08 16:49:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-08 16:49:14,021 INFO L472 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) [2024-11-08 16:49:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-08 16:49:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 16:49:14,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:14,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:14,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:49:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:49:14,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:14,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1188510451, now seen corresponding path program 1 times [2024-11-08 16:49:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:49:14,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058080118] [2024-11-08 16:49:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:14,225 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 [2024-11-08 16:49:14,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:49:14,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 16:49:14,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:49:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:14,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:49:14,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:14,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:14,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:49:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058080118] [2024-11-08 16:49:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058080118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:14,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:14,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:49:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146466773] [2024-11-08 16:49:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:49:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:49:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:49:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:49:14,445 INFO L87 Difference]: Start difference. First operand 11 states and 12 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) [2024-11-08 16:49:18,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:22,632 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 [] [2024-11-08 16:49:26,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:49:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:26,963 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-08 16:49:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:49:26,964 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 [2024-11-08 16:49:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:26,965 INFO L225 Difference]: With dead ends: 18 [2024-11-08 16:49:26,965 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 16:49:26,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:49:26,967 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:26,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-11-08 16:49:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 16:49:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-08 16:49:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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) [2024-11-08 16:49:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-08 16:49:26,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2024-11-08 16:49:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:26,973 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-08 16:49:26,973 INFO L472 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) [2024-11-08 16:49:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-08 16:49:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:49:26,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:26,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:26,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:49:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:49:27,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1956287918, now seen corresponding path program 1 times [2024-11-08 16:49:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:49:27,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935358084] [2024-11-08 16:49:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:27,177 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 [2024-11-08 16:49:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:49:27,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 16:49:27,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:49:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:28,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 16:49:28,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:42,419 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:49:47,881 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:49:54,037 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:50:01,175 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:50:37,644 WARN L286 SmtUtils]: Spent 22.50s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:50:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:50:37,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:50:54,637 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:02,911 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:11,219 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:19,444 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:23,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2))))) is different from false [2024-11-08 16:51:27,568 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2))))) is different from true [2024-11-08 16:51:35,797 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:44,020 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:52,305 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:00,586 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:06,615 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:14,816 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:23,280 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:28,696 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:36,905 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:42,485 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:47,838 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:54,948 WARN L286 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:00,429 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:08,624 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:12,969 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (fp.lt .cse0 .cse1) (fp.gt .cse0 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse9) .cse9)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse9) .cse1) (fp.geq .cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|))))))))) is different from true [2024-11-08 16:53:21,238 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:29,426 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:36,513 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:42,626 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:50,913 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:53:55,058 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (fp.lt .cse0 .cse1) (fp.gt .cse0 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse9) .cse9)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse9) .cse1) (fp.geq .cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))))))) is different from true [2024-11-08 16:54:04,539 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:54:15,237 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:54:21,891 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 37 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:54:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 16:54:21,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:54:21,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935358084] [2024-11-08 16:54:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935358084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:54:21,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:54:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2024-11-08 16:54:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281325414] [2024-11-08 16:54:21,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:54:21,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:54:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:54:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:54:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=85, Unknown=5, NotChecked=60, Total=182 [2024-11-08 16:54:21,895 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:26,236 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse5 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ 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))))) (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse5) .cse5)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse4 .cse5))) (or (fp.lt .cse1 .cse2) (fp.gt .cse1 .cse3) (fp.leq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse10) .cse10)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse9 .cse10) .cse2) (fp.geq .cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))))))) (let ((.cse14 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse13 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse13 .cse14 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (or (not .cse14) (not .cse13))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-08 16:54:31,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 (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_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (fp.lt .cse0 .cse1) (fp.gt .cse0 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse9) .cse9)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse9) .cse1) (fp.geq .cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-08 16:54:35,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 (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_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (fp.lt .cse0 .cse1) (fp.gt .cse0 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_48 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse9) .cse9)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse9) .cse1) (fp.geq .cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (= |c_ULTIMATE.start_main_~a~0#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 16:54:39,766 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2))))) (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_48 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) |c_ULTIMATE.start_inv_~A#1|) (= (let ((.cse3 (let ((.cse4 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_inv_~xi~0#1|))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 16:54:43,828 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2))))) (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_48 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) |c_ULTIMATE.start_inv_~A#1|) (= (let ((.cse3 (let ((.cse4 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_48)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_inv_~xi~0#1|))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-08 16:54:47,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:52,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:56,532 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 [0] [2024-11-08 16:55:00,541 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 [0] [2024-11-08 16:55:04,558 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] [2024-11-08 16:55:08,566 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 [0] [2024-11-08 16:55:12,580 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 [0] [2024-11-08 16:55:16,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:20,623 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 [0] [2024-11-08 16:55:24,630 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 [0] [2024-11-08 16:55:34,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:55:38,407 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 [] [2024-11-08 16:55:42,413 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 [] [2024-11-08 16:55:46,421 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 [] [2024-11-08 16:55:50,425 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 [0] [2024-11-08 16:55:54,432 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 [0] [2024-11-08 16:55:58,436 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 [] [2024-11-08 16:56:02,442 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 [] [2024-11-08 16:56:06,446 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 [] [2024-11-08 16:56:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:56:09,162 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-08 16:56:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:56:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 16:56:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:56:09,163 INFO L225 Difference]: With dead ends: 23 [2024-11-08 16:56:09,164 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 16:56:09,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 90.0s TimeCoverageRelationStatistics Valid=58, Invalid=166, Unknown=10, NotChecked=186, Total=420 [2024-11-08 16:56:09,165 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 79.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:56:09,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 18 Unknown, 85 Unchecked, 79.3s Time] [2024-11-08 16:56:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 16:56:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-08 16:56:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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) [2024-11-08 16:56:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-08 16:56:09,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-11-08 16:56:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:56:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-08 16:56:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:56:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-08 16:56:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:56:09,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:56:09,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:56:09,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:56:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:56:09,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:56:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:56:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1056058793, now seen corresponding path program 2 times [2024-11-08 16:56:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:56:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694561735] [2024-11-08 16:56:09,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:56:09,375 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 [2024-11-08 16:56:09,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:56:09,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 16:56:09,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_534987dd-12f9-4cae-aca7-f614189b884a/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:56:13,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:56:13,401 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:56:13,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:56:13,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:56:26,532 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:19,494 WARN L286 SmtUtils]: Spent 27.89s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:57:26,206 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:39,138 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:47,764 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:56,303 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:04,864 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:13,438 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:22,293 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:30,914 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:39,352 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:47,869 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:56,400 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:04,911 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:13,400 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:21,954 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:26,331 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 (fp.neg .cse1)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (let ((.cse10 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse8) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse8) .cse8))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse6))) (and (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 .cse3) (not (fp.lt .cse0 .cse4)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse6) .cse6)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.leq .cse2 .cse7)))))) (= (_ bv0 32) |c_ULTIMATE.start_inv_~cond~0#1|)) (and (= (_ bv1 32) |c_ULTIMATE.start_inv_~cond~0#1|) (or (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse13) .cse13))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse11) .cse1) (fp.geq .cse12 .cse3) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse11) .cse11)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.leq .cse12 .cse7))))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse18) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse16 .cse18) .cse18))))) (and (fp.geq .cse16 .cse3) (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse17) .cse4) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse17) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse16 .cse17) .cse17)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.leq .cse16 .cse7)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 16:59:35,043 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:43,558 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:52,158 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:00,720 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:09,226 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:13,609 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse4) .cse4)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 17:00:22,341 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:30,988 WARN L286 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:39,704 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:48,304 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:00:56,868 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:01,165 WARN L851 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ 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 .cse1 .cse6) .cse6))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse4)))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse0 .cse4)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (= |c_ULTIMATE.start_inv_#res#1| .cse0) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))))) is different from false [2024-11-08 17:01:13,886 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:22,404 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:31,042 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:39,526 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:48,004 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:56,472 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:13,581 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:22,113 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:30,725 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:39,225 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:47,703 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:00,338 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:08,823 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:17,325 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:25,842 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:34,430 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:38,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse7 (fp.neg .cse1)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (let ((.cse13 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse11) .cse11))))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse9) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse9) .cse9)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse2 .cse9))) (and (not (fp.gt .cse0 .cse1)) (fp.leq .cse2 .cse3) (fp.geq .cse4 .cse5) (fp.leq .cse4 .cse6) (not (fp.lt .cse0 .cse7)) (fp.geq .cse2 .cse8))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse18) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse16 .cse18) .cse18))))) (let ((.cse14 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse17) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse16 .cse17) .cse17)))) (let ((.cse15 (fp.sub roundNearestTiesToEven .cse14 .cse17))) (and (not (fp.geq .cse14 .cse8)) (not (fp.gt .cse15 .cse1)) (fp.geq .cse16 .cse5) (fp.leq .cse16 .cse6) (not (fp.lt .cse15 .cse7)))))))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse22 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))))) (fp ((_ extract 63 63) .cse26) ((_ extract 62 52) .cse26) ((_ extract 51 0) .cse26))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse25) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse22 .cse25) .cse25))))) (let ((.cse23 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse24) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse22 .cse24) .cse24)))) (let ((.cse21 (fp.sub roundNearestTiesToEven .cse23 .cse24))) (and (not (fp.gt .cse21 .cse1)) (fp.geq .cse22 .cse5) (fp.leq .cse22 .cse6) (not (fp.lt .cse21 .cse7)) (not (fp.leq .cse23 .cse3))))))))))))) is different from false [2024-11-08 17:03:51,724 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:00,338 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:08,946 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:17,451 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:25,955 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)