./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:58:16,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:58:16,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:58:16,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:58:16,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:58:16,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:58:16,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:58:16,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:58:16,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:58:16,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:58:16,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:58:16,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:58:16,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:58:16,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:58:16,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:58:16,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:58:16,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:58:16,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:58:16,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:58:16,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:58:16,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:58:16,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:58:16,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:58:16,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:58:16,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:58:16,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:58:16,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:58:16,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:58:16,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:58:16,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:58:16,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:58:16,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:58:16,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:58:16,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:58:16,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:58:16,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:58:16,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:58:16,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:58:16,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:58:16,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:58:16,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:58:16,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:58:16,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:58:16,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:58:16,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:58:16,877 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:58:16,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:58:16,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:58:16,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:58:16,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:58:16,880 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:58:16,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:58:16,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:58:16,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:58:16,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:58:16,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:58:16,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:58:16,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:58:16,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:58:16,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:58:16,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:58:16,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:58:16,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:58:16,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:58:16,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:58:16,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:58:16,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:16,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:58:16,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:58:16,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:58:16,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:58:16,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:58:16,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:58:16,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:58:16,888 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:58:16,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:58:16,888 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-23 03:58:17,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:58:17,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:58:17,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:58:17,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:58:17,193 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:58:17,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-23 03:58:20,357 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:58:20,599 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:58:20,600 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-23 03:58:20,612 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/abceaff5f/5084c7b0107141dbb084726384810a6e/FLAG6e9347974 [2022-11-23 03:58:20,636 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/abceaff5f/5084c7b0107141dbb084726384810a6e [2022-11-23 03:58:20,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:58:20,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:58:20,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:20,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:58:20,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:58:20,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ded0914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20, skipping insertion in model container [2022-11-23 03:58:20,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:58:20,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:58:20,821 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-23 03:58:20,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:20,846 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:58:20,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-23 03:58:20,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:20,875 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:58:20,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20 WrapperNode [2022-11-23 03:58:20,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:20,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:20,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:58:20,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:58:20,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,908 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-23 03:58:20,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:20,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:58:20,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:58:20,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:58:20,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:58:20,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:58:20,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:58:20,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:58:20,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (1/1) ... [2022-11-23 03:58:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:20,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:58:20,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:58:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:58:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:58:21,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:58:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:58:21,067 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:58:21,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:58:21,164 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:58:21,170 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:58:21,170 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:58:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:21 BoogieIcfgContainer [2022-11-23 03:58:21,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:58:21,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:58:21,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:58:21,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:58:21,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:58:20" (1/3) ... [2022-11-23 03:58:21,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc188bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:21, skipping insertion in model container [2022-11-23 03:58:21,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:20" (2/3) ... [2022-11-23 03:58:21,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc188bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:21, skipping insertion in model container [2022-11-23 03:58:21,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:21" (3/3) ... [2022-11-23 03:58:21,183 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-23 03:58:21,205 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:58:21,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:58:21,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:58:21,323 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68bfdf81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:58:21,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:58:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 03:58:21,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:21,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 03:58:21,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-23 03:58:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:21,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349548508] [2022-11-23 03:58:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:58:21,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:58:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:58:21,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:58:21,534 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:58:21,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 03:58:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:58:21,543 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-23 03:58:21,547 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:58:21,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:58:21 BoogieIcfgContainer [2022-11-23 03:58:21,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:58:21,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:58:21,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:58:21,567 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:58:21,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:21" (3/4) ... [2022-11-23 03:58:21,572 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:58:21,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:58:21,573 INFO L158 Benchmark]: Toolchain (without parser) took 932.65ms. Allocated memory is still 159.4MB. Free memory was 128.4MB in the beginning and 92.3MB in the end (delta: 36.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-23 03:58:21,574 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:58:21,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.95ms. Allocated memory is still 159.4MB. Free memory was 128.4MB in the beginning and 118.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 03:58:21,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.26ms. Allocated memory is still 159.4MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:58:21,577 INFO L158 Benchmark]: Boogie Preprocessor took 18.77ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 115.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:58:21,577 INFO L158 Benchmark]: RCFGBuilder took 244.54ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 106.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 03:58:21,578 INFO L158 Benchmark]: TraceAbstraction took 390.64ms. Allocated memory is still 159.4MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 03:58:21,578 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 159.4MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:58:21,582 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.95ms. Allocated memory is still 159.4MB. Free memory was 128.4MB in the beginning and 118.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.26ms. Allocated memory is still 159.4MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.77ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 115.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 244.54ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 106.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 390.64ms. Allocated memory is still 159.4MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 159.4MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [cond=0, unknown-#in~cond-unknown=0] [L4] reach_error() VAL [cond=0, unknown-#in~cond-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 03:58:21,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:58:24,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:58:24,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:58:24,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:58:24,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:58:24,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:58:24,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:58:24,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:58:24,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:58:24,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:58:24,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:58:24,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:58:24,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:58:24,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:58:24,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:58:24,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:58:24,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:58:24,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:58:24,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:58:24,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:58:24,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:58:24,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:58:24,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:58:24,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:58:24,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:58:24,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:58:24,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:58:24,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:58:24,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:58:24,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:58:24,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:58:24,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:58:24,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:58:24,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:58:24,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:58:24,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:58:24,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:58:24,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:58:24,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:58:24,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:58:24,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:58:24,390 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-23 03:58:24,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:58:24,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:58:24,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:58:24,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:58:24,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:58:24,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:58:24,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:58:24,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:58:24,436 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:58:24,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:58:24,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:58:24,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:58:24,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:58:24,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:58:24,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:58:24,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:58:24,439 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:58:24,439 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:58:24,439 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:58:24,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:58:24,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:58:24,440 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:58:24,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:58:24,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:58:24,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:58:24,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:58:24,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:24,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:58:24,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:58:24,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:58:24,443 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:58:24,443 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:58:24,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:58:24,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:58:24,444 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:58:24,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:58:24,444 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:58:24,444 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-11-23 03:58:24,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:58:24,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:58:24,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:58:24,882 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:58:24,882 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:58:24,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-11-23 03:58:28,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:58:28,483 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:58:28,483 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c [2022-11-23 03:58:28,492 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/824d479fd/4be3018155964d9f8309add9bcc4441c/FLAGfde3368c8 [2022-11-23 03:58:28,508 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/data/824d479fd/4be3018155964d9f8309add9bcc4441c [2022-11-23 03:58:28,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:58:28,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:58:28,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:28,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:58:28,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:58:28,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b6bb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28, skipping insertion in model container [2022-11-23 03:58:28,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:58:28,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:58:28,695 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-23 03:58:28,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:28,730 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:58:28,752 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-11-23 03:58:28,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:28,786 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:58:28,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28 WrapperNode [2022-11-23 03:58:28,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:28,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:28,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:58:28,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:58:28,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,832 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-23 03:58:28,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:28,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:58:28,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:58:28,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:58:28,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,887 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:58:28,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:58:28,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:58:28,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:58:28,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (1/1) ... [2022-11-23 03:58:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:28,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:58:28,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:58:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:58:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:58:29,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:58:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:58:29,092 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:58:29,095 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:58:29,670 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:58:29,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:58:29,676 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:58:29,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:29 BoogieIcfgContainer [2022-11-23 03:58:29,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:58:29,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:58:29,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:58:29,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:58:29,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:58:28" (1/3) ... [2022-11-23 03:58:29,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb49e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:29, skipping insertion in model container [2022-11-23 03:58:29,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:28" (2/3) ... [2022-11-23 03:58:29,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb49e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:29, skipping insertion in model container [2022-11-23 03:58:29,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:29" (3/3) ... [2022-11-23 03:58:29,687 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-11-23 03:58:29,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:58:29,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:58:29,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:58:29,769 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c86cf89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:58:29,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:58:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 03:58:29,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:29,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 03:58:29,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-11-23 03:58:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:58:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127135803] [2022-11-23 03:58:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:29,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:58:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:58:29,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:58:29,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 03:58:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:29,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:58:29,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:58:30,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:30,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:58:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127135803] [2022-11-23 03:58:30,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127135803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:30,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:30,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:58:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772892953] [2022-11-23 03:58:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:30,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:58:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:58:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:58:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:58:30,051 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:30,286 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-23 03:58:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:58:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 03:58:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:30,298 INFO L225 Difference]: With dead ends: 20 [2022-11-23 03:58:30,298 INFO L226 Difference]: Without dead ends: 8 [2022-11-23 03:58:30,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:58:30,305 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:30,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:58:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-23 03:58:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-23 03:58:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-23 03:58:30,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-23 03:58:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:30,333 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-23 03:58:30,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-23 03:58:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 03:58:30,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:30,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:30,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:58:30,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:58:30,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-11-23 03:58:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:58:30,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303137119] [2022-11-23 03:58:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:30,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:58:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:58:30,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:58:30,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 03:58:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:30,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:58:30,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:58:30,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:58:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:58:34,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:58:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303137119] [2022-11-23 03:58:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303137119] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:58:34,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:58:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-23 03:58:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932350970] [2022-11-23 03:58:34,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:58:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:58:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:58:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:58:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2022-11-23 03:58:34,850 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:41,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:43,097 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-23 03:58:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:58:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 03:58:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:43,103 INFO L225 Difference]: With dead ends: 15 [2022-11-23 03:58:43,103 INFO L226 Difference]: Without dead ends: 11 [2022-11-23 03:58:43,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2022-11-23 03:58:43,105 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:43,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-23 03:58:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-23 03:58:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-23 03:58:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-23 03:58:43,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-11-23 03:58:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:43,111 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-23 03:58:43,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:58:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-23 03:58:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 03:58:43,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:43,112 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:43,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:58:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:58:43,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-11-23 03:58:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:58:43,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817705142] [2022-11-23 03:58:43,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:58:43,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:58:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:58:43,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:58:43,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 03:58:43,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:58:43,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:58:43,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 03:58:43,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:58:47,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:15,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from false [2022-11-23 03:59:23,682 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-11-23 03:59:25,709 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-11-23 03:59:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 03:59:25,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:59:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817705142] [2022-11-23 03:59:25,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817705142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:25,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:25,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-23 03:59:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777914251] [2022-11-23 03:59:25,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:25,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 03:59:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:59:25,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 03:59:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=70, Unknown=6, NotChecked=38, Total=156 [2022-11-23 03:59:25,722 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:59:29,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:31,270 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 03:59:56,413 WARN L233 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:59:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:09,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:11,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:15,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:19,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:20,317 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-23 04:00:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 04:00:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 04:00:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:20,332 INFO L225 Difference]: With dead ends: 19 [2022-11-23 04:00:20,332 INFO L226 Difference]: Without dead ends: 15 [2022-11-23 04:00:20,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=84, Invalid=130, Unknown=8, NotChecked=84, Total=306 [2022-11-23 04:00:20,335 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:20,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 5 Unknown, 22 Unchecked, 19.5s Time] [2022-11-23 04:00:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-23 04:00:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-23 04:00:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-23 04:00:20,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-11-23 04:00:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:20,342 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-23 04:00:20,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-23 04:00:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 04:00:20,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:20,343 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:20,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 04:00:20,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 04:00:20,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:20,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 3 times [2022-11-23 04:00:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327976607] [2022-11-23 04:00:20,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 04:00:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 04:00:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:20,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 04:00:20,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 04:00:21,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 04:00:21,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 04:00:21,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 04:00:21,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:00:53,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:01:25,594 WARN L233 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:45,851 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-23 04:02:02,663 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2022-11-23 04:02:04,697 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2022-11-23 04:02:23,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-23 04:02:25,333 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-23 04:02:44,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-23 04:02:46,083 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-23 04:03:04,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-11-23 04:03:06,912 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-11-23 04:03:25,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2022-11-23 04:03:27,976 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2022-11-23 04:03:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-23 04:03:27,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:03:27,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327976607] [2022-11-23 04:03:27,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327976607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 04:03:27,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 04:03:27,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-23 04:03:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032718561] [2022-11-23 04:03:27,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 04:03:28,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 04:03:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:03:28,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 04:03:28,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=141, Unknown=19, NotChecked=186, Total=420 [2022-11-23 04:03:28,001 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:03:30,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:32,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:34,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:35,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:37,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:40,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:43,172 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-23 04:03:45,234 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 04:03:47,308 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse4 .cse4)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 04:03:50,349 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 04:03:53,723 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from true [2022-11-23 04:03:55,769 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) .cse5) .cse5)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 04:04:06,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:43,682 WARN L233 SmtUtils]: Spent 21.83s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:04:45,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:56,781 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:04:58,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:00,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:48,305 WARN L233 SmtUtils]: Spent 32.93s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:05:50,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:52,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:53,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:54,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:05:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:05:54,706 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-11-23 04:05:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 04:05:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 04:05:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:05:54,734 INFO L225 Difference]: With dead ends: 23 [2022-11-23 04:05:54,734 INFO L226 Difference]: Without dead ends: 19 [2022-11-23 04:05:54,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 197.5s TimeCoverageRelationStatistics Valid=151, Invalid=247, Unknown=26, NotChecked=506, Total=930 [2022-11-23 04:05:54,736 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:05:54,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 9 Unknown, 70 Unchecked, 29.5s Time] [2022-11-23 04:05:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-23 04:05:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-23 04:05:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-11-23 04:05:54,748 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-11-23 04:05:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:05:54,748 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-11-23 04:05:54,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:05:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-11-23 04:05:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 04:05:54,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:05:54,750 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2022-11-23 04:05:54,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 04:05:54,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 04:05:54,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:05:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:05:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1499312107, now seen corresponding path program 4 times [2022-11-23 04:05:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:05:54,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649743691] [2022-11-23 04:05:54,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 04:05:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 04:05:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:05:54,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 04:05:54,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_361cfe88-74ad-4f63-853a-37f1fee15be9/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 04:05:56,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 04:05:56,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 04:05:56,788 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-23 04:05:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:07:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:07:29,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:08:09,866 WARN L233 SmtUtils]: Spent 11.65s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:08:29,157 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-11-23 04:08:51,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2022-11-23 04:08:53,858 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2022-11-23 04:09:20,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from false [2022-11-23 04:09:22,815 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from true [2022-11-23 04:09:54,038 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from false [2022-11-23 04:09:56,097 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from true [2022-11-23 04:10:31,131 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from false [2022-11-23 04:10:33,194 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from true [2022-11-23 04:11:13,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from false [2022-11-23 04:11:15,522 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from true [2022-11-23 04:12:00,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from false [2022-11-23 04:12:02,442 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from true [2022-11-23 04:12:51,691 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from false [2022-11-23 04:12:53,781 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from true [2022-11-23 04:13:47,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from false [2022-11-23 04:13:49,966 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from true