./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-28 04:54:12,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:54:12,494 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:54:12,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:54:12,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:54:12,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:54:12,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:54:12,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:54:12,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:54:12,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:54:12,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:54:12,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:54:12,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:54:12,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:54:12,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:54:12,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:54:12,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:54:12,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:54:12,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:54:12,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:54:12,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:54:12,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:54:12,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:54:12,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:54:12,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB 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-28 04:54:12,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:54:12,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:54:12,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:54:12,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:54:12,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:54:12,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-28 04:54:16,432 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/ea9d6a0c8/90942e1374174772aadecb49e693dd14/FLAGa90fb8b3a [2024-11-28 04:54:16,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:54:16,771 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-28 04:54:16,782 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/ea9d6a0c8/90942e1374174772aadecb49e693dd14/FLAGa90fb8b3a [2024-11-28 04:54:16,802 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/ea9d6a0c8/90942e1374174772aadecb49e693dd14 [2024-11-28 04:54:16,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:54:16,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:54:16,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:54:16,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:54:16,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:54:16,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:54:16" (1/1) ... [2024-11-28 04:54:16,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92dff8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:16, skipping insertion in model container [2024-11-28 04:54:16,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:54:16" (1/1) ... [2024-11-28 04:54:16,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:54:17,066 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_d940fa90-ecdb-433e-b246-a15f256f6482/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-28 04:54:17,073 ERROR L321 MainTranslator]: Unsupported Syntax: floats in unions are not supported in the integer translation. [2024-11-28 04:54:17,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3826d25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:17, skipping insertion in model container [2024-11-28 04:54:17,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:54:17,074 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-28 04:54:17,076 INFO L158 Benchmark]: Toolchain (without parser) took 268.49ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 94.2MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:54:17,077 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:54:17,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.15ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 94.2MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:54:17,079 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.35ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.15ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 94.2MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 18]: Unsupported Syntax floats in unions are not supported in the integer translation. RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-28 04:54:20,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:54:20,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 04:54:20,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:54:20,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:54:20,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:54:20,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:54:20,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:54:20,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:54:20,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:54:20,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:54:20,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:54:20,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:54:20,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:54:20,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:54:20,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:54:20,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:54:20,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:54:20,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:54:20,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:54:20,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:54:20,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:54:20,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:54:20,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:54:20,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:54:20,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:54:20,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:54:20,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:54:20,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:54:20,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:54:20,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:54:20,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:54:20,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:54:20,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:54:20,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:54:20,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:54:20,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:54:20,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:54:20,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:54:20,391 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:54:20,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:54:20,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:54:20,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:54:20,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:54:20,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:54:20,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB 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-28 04:54:20,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:54:20,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:54:20,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:54:20,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:54:20,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:54:20,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-28 04:54:24,216 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/b5990d69f/9efb04515d0f409b9ac436d817310d16/FLAG412431f09 [2024-11-28 04:54:24,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:54:24,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2024-11-28 04:54:24,517 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/b5990d69f/9efb04515d0f409b9ac436d817310d16/FLAG412431f09 [2024-11-28 04:54:24,816 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/data/b5990d69f/9efb04515d0f409b9ac436d817310d16 [2024-11-28 04:54:24,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:54:24,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:54:24,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:54:24,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:54:24,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:54:24,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:54:24" (1/1) ... [2024-11-28 04:54:24,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447232d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:24, skipping insertion in model container [2024-11-28 04:54:24,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:54:24" (1/1) ... [2024-11-28 04:54:24,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:54:25,088 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_d940fa90-ecdb-433e-b246-a15f256f6482/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-28 04:54:25,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:54:25,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:54:25,174 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_d940fa90-ecdb-433e-b246-a15f256f6482/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2024-11-28 04:54:25,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:54:25,234 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:54:25,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25 WrapperNode [2024-11-28 04:54:25,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:54:25,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:54:25,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:54:25,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:54:25,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,305 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2024-11-28 04:54:25,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:54:25,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:54:25,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:54:25,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:54:25,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,352 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 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, 2, 1]. [2024-11-28 04:54:25,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:54:25,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:54:25,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:54:25,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:54:25,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (1/1) ... [2024-11-28 04:54:25,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:54:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:25,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:54:25,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-28 04:54:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-11-28 04:54:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:54:25,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:54:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2024-11-28 04:54:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2024-11-28 04:54:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2024-11-28 04:54:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:54:25,578 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:54:25,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:54:29,948 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-28 04:54:29,948 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:54:29,960 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:54:29,960 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 04:54:29,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:54:29 BoogieIcfgContainer [2024-11-28 04:54:29,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:54:29,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:54:29,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:54:29,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:54:29,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:54:24" (1/3) ... [2024-11-28 04:54:29,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f28838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:54:29, skipping insertion in model container [2024-11-28 04:54:29,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:54:25" (2/3) ... [2024-11-28 04:54:29,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f28838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:54:29, skipping insertion in model container [2024-11-28 04:54:29,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:54:29" (3/3) ... [2024-11-28 04:54:29,980 INFO L128 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2024-11-28 04:54:29,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:54:30,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG inv_Newton-1.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 04:54:30,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:54:30,092 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;@2b73fd77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:54:30,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:54:30,098 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-28 04:54:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:54:30,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:30,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:30,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:54:30,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -589236690, now seen corresponding path program 1 times [2024-11-28 04:54:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:54:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68697907] [2024-11-28 04:54:30,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:30,138 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-28 04:54:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 04:54:30,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:30,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:54:30,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:30,370 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-28 04:54:30,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:54:30,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:54:30,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68697907] [2024-11-28 04:54:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68697907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:30,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:54:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:54:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696465084] [2024-11-28 04:54:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:54:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:54:30,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:54:30,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:54:30,401 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-28 04:54:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:30,414 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-28 04:54:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:54:30,417 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-28 04:54:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:30,423 INFO L225 Difference]: With dead ends: 27 [2024-11-28 04:54:30,423 INFO L226 Difference]: Without dead ends: 11 [2024-11-28 04:54:30,425 INFO L434 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-28 04:54:30,429 INFO L435 NwaCegarLoop]: 15 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, 15 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-28 04:54:30,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:54:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-28 04:54:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-28 04:54:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:54:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-28 04:54:30,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2024-11-28 04:54:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:30,460 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-28 04:54:30,461 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-28 04:54:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-28 04:54:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:54:30,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:30,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:30,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:54:30,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1185770672, now seen corresponding path program 1 times [2024-11-28 04:54:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:54:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912670692] [2024-11-28 04:54:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:30,664 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-28 04:54:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 04:54:30,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:30,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 04:54:30,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:30,857 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-28 04:54:30,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:54:30,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:54:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912670692] [2024-11-28 04:54:30,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912670692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:30,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:54:30,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:54:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112779866] [2024-11-28 04:54:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:30,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:54:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:54:30,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:54:30,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:54:30,860 INFO L87 Difference]: Start difference. First operand 11 states and 11 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-28 04:54:35,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:35,143 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-28 04:54:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:54:35,144 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-28 04:54:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:35,145 INFO L225 Difference]: With dead ends: 17 [2024-11-28 04:54:35,145 INFO L226 Difference]: Without dead ends: 12 [2024-11-28 04:54:35,145 INFO L434 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-28 04:54:35,146 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:35,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 04:54:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-28 04:54:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-28 04:54:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-28 04:54:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-28 04:54:35,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2024-11-28 04:54:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-28 04:54:35,152 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-28 04:54:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-28 04:54:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:54:35,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:35,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:35,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:35,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:54:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -537782644, now seen corresponding path program 1 times [2024-11-28 04:54:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:54:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102079928] [2024-11-28 04:54:35,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:35,356 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-28 04:54:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 04:54:35,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:35,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 04:54:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:36,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 04:54:36,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:46,349 WARN L286 SmtUtils]: Spent 8.15s 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-28 04:54:54,656 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:55:02,822 WARN L286 SmtUtils]: Spent 8.16s 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-28 04:55:11,059 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:55:19,325 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:55:27,490 WARN L286 SmtUtils]: Spent 8.16s 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-28 04:55:35,730 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:55:44,086 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:55:52,242 WARN L286 SmtUtils]: Spent 8.16s 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-28 04:56:00,535 WARN L286 SmtUtils]: Spent 8.29s 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-28 04:56:08,851 WARN L286 SmtUtils]: Spent 8.32s 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-28 04:56:17,095 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:56:25,283 WARN L286 SmtUtils]: Spent 8.15s 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-28 04:56:33,501 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:56:41,706 WARN L286 SmtUtils]: Spent 8.16s 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-28 04:56:49,931 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:56:54,178 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse4 (fp.neg .cse5)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (or (and (exists ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse8 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse1)) (.cse2 (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|)))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) .cse1))) (not (fp.lt .cse3 .cse4)) (not (fp.gt .cse3 .cse5)) (fp.leq .cse2 .cse6) (fp.geq .cse2 .cse7))))) (= (_ bv0 32) |c_ULTIMATE.start_inv_~cond~0#1|)) (and (or (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse10 (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|)))) (and (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse9 (let ((.cse11 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse9) .cse9))) (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse9) .cse5)))) (fp.leq .cse10 .cse6) (fp.geq .cse10 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse12 (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|)))) (and (fp.leq .cse12 .cse6) (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse13) .cse13))) (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse13) .cse4)))) (fp.geq .cse12 .cse7))))) (= (_ bv1 32) |c_ULTIMATE.start_inv_~cond~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 04:57:02,515 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:57:10,680 WARN L286 SmtUtils]: Spent 8.16s 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-28 04:57:18,908 WARN L286 SmtUtils]: Spent 8.23s 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-28 04:57:27,170 WARN L286 SmtUtils]: Spent 8.26s 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-28 04:57:35,412 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:57:39,517 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse1 (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|)))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) .cse0))) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 20.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 04:57:47,844 WARN L286 SmtUtils]: Spent 8.31s 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-28 04:57:56,124 WARN L286 SmtUtils]: Spent 8.28s 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-28 04:58:04,462 WARN L286 SmtUtils]: Spent 8.34s 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-28 04:58:12,716 WARN L286 SmtUtils]: Spent 8.25s 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-28 04:58:21,067 WARN L286 SmtUtils]: Spent 8.35s 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-28 04:58:25,163 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse3 (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|))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (= |c_ULTIMATE.start_inv_#res#1| .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 04:58:33,624 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:58:39,131 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:58:47,436 WARN L286 SmtUtils]: Spent 8.30s 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-28 04:58:55,716 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:59:04,007 WARN L286 SmtUtils]: Spent 8.29s 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-28 04:59:12,264 WARN L286 SmtUtils]: Spent 8.26s 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-28 04:59:31,518 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:59:39,757 WARN L286 SmtUtils]: Spent 8.24s 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-28 04:59:47,994 WARN L286 SmtUtils]: Spent 8.24s 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-28 05:00:00,331 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:00:08,565 WARN L286 SmtUtils]: Spent 8.23s 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-28 05:00:12,754 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse0 (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|)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse7) .cse7)))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse3 .cse7))) (and (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6)))))))))) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse12 (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|)))) (and (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (and (not (fp.geq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse10 .cse11) .cse6)))))) (fp.geq .cse12 .cse1) (fp.leq .cse12 .cse2))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2024-11-28 05:00:25,141 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:00:33,428 WARN L286 SmtUtils]: Spent 8.29s 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-28 05:00:41,690 WARN L286 SmtUtils]: Spent 8.26s 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-28 05:00:54,062 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:01:02,299 WARN L286 SmtUtils]: Spent 8.24s 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-28 05:01:06,498 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse0 (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|)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse7) .cse7)))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse3 .cse7))) (and (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6)))))))))) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse12 (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|)))) (and (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (and (not (fp.geq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse10 .cse11) .cse6)))))) (fp.geq .cse12 .cse1) (fp.leq .cse12 .cse2))))))) is different from false [2024-11-28 05:01:10,564 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse0 (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|)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse7) .cse7)))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse3 .cse7))) (and (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6)))))))))) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse12 (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|)))) (and (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (and (not (fp.geq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse10 .cse11) .cse6)))))) (fp.geq .cse12 .cse1) (fp.leq .cse12 .cse2))))))) is different from true [2024-11-28 05:01:10,565 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-28 05:01:10,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:19,885 WARN L286 SmtUtils]: Spent 8.29s 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-28 05:01:28,173 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-28 05:01:36,479 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-28 05:01:44,767 WARN L286 SmtUtils]: Spent 8.29s 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-28 05:01:48,841 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-28 05:01:52,916 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-28 05:02:01,171 WARN L286 SmtUtils]: Spent 8.25s 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-28 05:02:09,428 WARN L286 SmtUtils]: Spent 8.26s 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-28 05:02:17,709 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:02:25,971 WARN L286 SmtUtils]: Spent 8.26s 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-28 05:02:34,267 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:02:42,553 WARN L286 SmtUtils]: Spent 8.29s 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-28 05:02:50,841 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-28 05:02:59,139 WARN L286 SmtUtils]: Spent 8.30s 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-28 05:03:07,418 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:03:15,728 WARN L286 SmtUtils]: Spent 8.31s 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-28 05:03:24,074 WARN L286 SmtUtils]: Spent 8.33s 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-28 05:03:32,325 WARN L286 SmtUtils]: Spent 8.25s 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-28 05:03:40,573 WARN L286 SmtUtils]: Spent 8.25s 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-28 05:03:48,862 WARN L286 SmtUtils]: Spent 8.26s 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-28 05:03:57,113 WARN L286 SmtUtils]: Spent 8.25s 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-28 05:04:05,383 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:04:09,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse7 (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)))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse7 .cse9))) (or (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse8 .cse2) (fp.lt .cse8 .cse3)))))) (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-28 05:04:18,246 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:04:26,523 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:04:34,795 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:04:43,093 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:04:51,360 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:04:59,635 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:05:03,819 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 ((.cse3 (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse7 (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)))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse7 .cse9))) (or (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse8 .cse2) (fp.lt .cse8 .cse3)))))) (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-28 05:05:12,137 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:05:20,400 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:05:28,664 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:05:36,933 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:05:45,204 WARN L286 SmtUtils]: Spent 8.27s 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-28 05:05:53,504 WARN L286 SmtUtils]: Spent 8.30s 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-28 05:06:01,774 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:06:10,046 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:06:18,307 WARN L286 SmtUtils]: Spent 8.26s 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-28 05:06:26,587 WARN L286 SmtUtils]: Spent 8.28s 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-28 05:06:30,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (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|))) (.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse7)))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse7))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (fp.lt .cse3 .cse4) (fp.gt .cse3 .cse5) (fp.geq .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))))) (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (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|))) (.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse13) .cse13)))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse12 .cse13))) (or (not (fp.leq .cse10 .cse1)) (not (fp.geq .cse10 .cse2)) (fp.lt .cse11 .cse4) (fp.gt .cse11 .cse5) (fp.leq .cse12 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))))))))))) is different from false [2024-11-28 05:06:34,785 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (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|))) (.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse7)))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse7))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (fp.lt .cse3 .cse4) (fp.gt .cse3 .cse5) (fp.geq .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))))) (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (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|))) (.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse13) .cse13)))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse12 .cse13))) (or (not (fp.leq .cse10 .cse1)) (not (fp.geq .cse10 .cse2)) (fp.lt .cse11 .cse4) (fp.gt .cse11 .cse5) (fp.leq .cse12 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))))))))))) is different from true [2024-11-28 05:06:34,785 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-28 05:06:34,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102079928] [2024-11-28 05:06:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102079928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:06:34,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:34,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-11-28 05:06:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336717381] [2024-11-28 05:06:34,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:06:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:34,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:06:34,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=75, Unknown=12, NotChecked=216, Total=342 [2024-11-28 05:06:34,792 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 05:06:38,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (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|))) (.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse7)))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse7))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (fp.lt .cse3 .cse4) (fp.gt .cse3 .cse5) (fp.geq .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))))) (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (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|))) (.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse13) .cse13)))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse12 .cse13))) (or (not (fp.leq .cse10 .cse1)) (not (fp.geq .cse10 .cse2)) (fp.lt .cse11 .cse4) (fp.gt .cse11 .cse5) (fp.leq .cse12 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-28 05:06:43,095 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (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|))) (.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse7)))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse7))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (fp.lt .cse3 .cse4) (fp.gt .cse3 .cse5) (fp.geq .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))))) (forall ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (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|))) (.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse13) .cse13)))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse12 .cse13))) (or (not (fp.leq .cse10 .cse1)) (not (fp.geq .cse10 .cse2)) (fp.lt .cse11 .cse4) (fp.gt .cse11 .cse5) (fp.leq .cse12 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 05:06:47,255 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse0 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse0 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse2 (or (not .cse1) (not .cse0))))) (or .cse2 (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse7 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse7) .cse7)))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse3 .cse7))) (or (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse4 .cse5) (fp.lt .cse4 .cse6)))))) (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse12) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| .cse12) .cse12)))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse10 .cse12))) (or (fp.geq .cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse11 .cse5) (fp.lt .cse11 .cse6)))))) (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-28 05:06:51,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse7 (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)))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse7 .cse9))) (or (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse8 .cse2) (fp.lt .cse8 .cse3)))))) (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-28 05:06:55,457 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (forall ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (or (forall ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (let ((.cse0 (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 ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (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_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse7 (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)))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse7 .cse9))) (or (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse8 .cse2) (fp.lt .cse8 .cse3)))))) (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-28 05:06:59,534 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_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ 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|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse3 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (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-28 05:07:03,621 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_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ 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|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse3 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (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-28 05:07:07,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) |c_ULTIMATE.start_inv_~cond~0#1|))) (and (or (not .cse0) (and (fp.geq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_inv_~xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse5 (fp.neg .cse6)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (or (and (exists ((v_ArrVal_50 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse2 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse2)) (.cse3 (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|)))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse2) .cse2))) (not (fp.lt .cse4 .cse5)) (not (fp.gt .cse4 .cse6)) (fp.leq .cse3 .cse7) (fp.geq .cse3 .cse8))))) .cse0) (and (or (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse11 (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|)))) (and (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse10 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse11 .cse10) .cse10))) (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse10) .cse6)))) (fp.leq .cse11 .cse7) (fp.geq .cse11 .cse8)))) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse13 (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|)))) (and (fp.leq .cse13 .cse7) (exists ((v_ArrVal_50 (_ BitVec 32)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse14 (let ((.cse15 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) v_ArrVal_50) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_46))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse14) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse13 .cse14) .cse14))) (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse14) .cse5)))) (fp.geq .cse13 .cse8))))) (= (_ bv1 32) |c_ULTIMATE.start_inv_~cond~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 05:07:13,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:07:17,263 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-28 05:07:21,268 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-28 05:07:25,275 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-28 05:07:29,278 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-28 05:07:33,283 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-28 05:07:37,287 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-28 05:07:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:37,876 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-28 05:07:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:07:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 05:07:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:37,877 INFO L225 Difference]: With dead ends: 19 [2024-11-28 05:07:37,877 INFO L226 Difference]: Without dead ends: 14 [2024-11-28 05:07:37,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=49, Invalid=77, Unknown=20, NotChecked=406, Total=552 [2024-11-28 05:07:37,879 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:37,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 7 Unknown, 169 Unchecked, 28.9s Time] [2024-11-28 05:07:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-28 05:07:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-28 05:07:37,884 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-28 05:07:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-28 05:07:37,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-11-28 05:07:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-28 05:07:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 05:07:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-28 05:07:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:07:37,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:37,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:07:37,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-28 05:07:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:07:38,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:07:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash 984856936, now seen corresponding path program 2 times [2024-11-28 05:07:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:07:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506629605] [2024-11-28 05:07:38,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:07:38,090 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-28 05:07:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:07:38,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:07:38,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d940fa90-ecdb-433e-b246-a15f256f6482/bin/uautomizer-verify-aQ6SnzHsRB/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-28 05:07:41,090 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:07:41,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:07:41,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 05:07:41,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:49,006 WARN L286 SmtUtils]: Spent 6.12s 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-28 05:07:55,849 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:07:59,930 WARN L851 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (v_ArrVal_69 (_ BitVec 32))) (and (= (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|)) |c_ULTIMATE.start_inv_~A#1|) (= (let ((.cse0 (let ((.cse1 (let ((.cse2 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) v_ArrVal_69) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| .cse0) .cse0))) |c_ULTIMATE.start_inv_~xi~0#1|))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 05:08:07,472 WARN L286 SmtUtils]: Spent 7.46s 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-28 05:08:13,721 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:08:22,396 WARN L286 SmtUtils]: Spent 8.54s 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-28 05:08:30,836 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-28 05:08:39,335 WARN L286 SmtUtils]: Spent 8.50s 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-28 05:08:47,790 WARN L286 SmtUtils]: Spent 8.45s 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-28 05:08:56,341 WARN L286 SmtUtils]: Spent 8.55s 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-28 05:09:04,982 WARN L286 SmtUtils]: Spent 8.64s 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-28 05:09:13,444 WARN L286 SmtUtils]: Spent 8.46s 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-28 05:09:22,174 WARN L286 SmtUtils]: Spent 8.52s 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-28 05:09:30,583 WARN L286 SmtUtils]: Spent 8.41s 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-28 05:09:39,156 WARN L286 SmtUtils]: Spent 8.50s 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)