./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- 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 15:56:39,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:56:39,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:56:39,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:56:39,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:56:39,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:56:39,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:56:39,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:56:39,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:56:39,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:56:39,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:56:39,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:56:39,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:56:39,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:56:39,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:56:39,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:56:39,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:56:39,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:56:39,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:56:39,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:56:39,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:56:39,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:56:39,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:56:39,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:56:39,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:56:39,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:56:39,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:56:39,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:56:39,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:56:39,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:56:39,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:56:39,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:56:39,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:56:39,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:56:39,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:56:39,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:56:39,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:56:39,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:56:39,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:56:39,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:56:39,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:56:39,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:56:39,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:56:39,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:56:39,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:56:39,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:56:39,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:56:39,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:56:39,964 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:56:39,965 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:56:39,965 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:56:39,965 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:56:39,965 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:56:39,966 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:56:39,966 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:56:39,966 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:56:39,966 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:56:39,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:56:39,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:56:39,967 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:56:39,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:56:39,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:56:39,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:56:39,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:56:39,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:56:39,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:56:39,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:56:39,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:56:39,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:56:39,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:56:39,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:56:39,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:56:39,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:56:39,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:56:39,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:56:39,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:56:39,972 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:56:39,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:56:39,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:56:39,972 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:56:39,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:56:39,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:56:39,973 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:56:39,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2022-11-23 15:56:40,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:56:40,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:56:40,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:56:40,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:56:40,310 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:56:40,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-11-23 15:56:43,299 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:56:43,516 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:56:43,517 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-11-23 15:56:43,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/6fb1486aa/6a01fd97a2414864876cf7fe8e7c698c/FLAG8969b649f [2022-11-23 15:56:43,551 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/6fb1486aa/6a01fd97a2414864876cf7fe8e7c698c [2022-11-23 15:56:43,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:56:43,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:56:43,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:56:43,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:56:43,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:56:43,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45585d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43, skipping insertion in model container [2022-11-23 15:56:43,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:56:43,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:56:43,788 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2022-11-23 15:56:43,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:56:43,822 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:56:43,837 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2022-11-23 15:56:43,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:56:43,859 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:56:43,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43 WrapperNode [2022-11-23 15:56:43,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:56:43,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:56:43,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:56:43,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:56:43,870 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:56:43" (1/1) ... [2022-11-23 15:56:43,879 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:56:43" (1/1) ... [2022-11-23 15:56:43,897 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-23 15:56:43,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:56:43,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:56:43,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:56:43,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:56:43,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,941 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:56:43,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:56:43,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:56:43,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:56:43,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2022-11-23 15:56:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:56:43,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:56:43,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:56:43,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:56:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:56:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:56:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:56:44,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:56:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 15:56:44,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 15:56:44,081 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:56:44,084 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:56:44,275 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:56:44,313 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:56:44,313 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 15:56:44,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:44 BoogieIcfgContainer [2022-11-23 15:56:44,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:56:44,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:56:44,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:56:44,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:56:44,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:43" (1/3) ... [2022-11-23 15:56:44,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275164cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:44, skipping insertion in model container [2022-11-23 15:56:44,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (2/3) ... [2022-11-23 15:56:44,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275164cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:44, skipping insertion in model container [2022-11-23 15:56:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:44" (3/3) ... [2022-11-23 15:56:44,333 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2022-11-23 15:56:44,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:56:44,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:56:44,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:56:44,430 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=FINITE_AUTOMATA, 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;@181bd68e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:56:44,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:56:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:56:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:56:44,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:56:44,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:56:44,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:56:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:56:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522412, now seen corresponding path program 1 times [2022-11-23 15:56:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:56:44,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116237457] [2022-11-23 15:56:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:56:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:56:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:56:44,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:56:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:56:44,677 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:56:44,679 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:56:44,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:56:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:56:44,689 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-23 15:56:44,694 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:56:44,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:56:44 BoogieIcfgContainer [2022-11-23 15:56:44,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:56:44,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:56:44,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:56:44,719 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:56:44,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:44" (3/4) ... [2022-11-23 15:56:44,722 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:56:44,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:56:44,724 INFO L158 Benchmark]: Toolchain (without parser) took 1166.98ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 152.8MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:56:44,724 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 134.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:56:44,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.14ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 130.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 15:56:44,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 129.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:56:44,726 INFO L158 Benchmark]: Boogie Preprocessor took 45.16ms. Allocated memory is still 184.5MB. Free memory was 129.1MB in the beginning and 127.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:56:44,731 INFO L158 Benchmark]: RCFGBuilder took 373.24ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 116.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 15:56:44,733 INFO L158 Benchmark]: TraceAbstraction took 396.48ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 152.8MB in the end (delta: -36.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-11-23 15:56:44,734 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 152.8MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:56:44,742 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.29ms. Allocated memory is still 134.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.14ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 130.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 129.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.16ms. Allocated memory is still 184.5MB. Free memory was 129.1MB in the beginning and 127.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 373.24ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 116.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 396.48ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 152.8MB in the end (delta: -36.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 152.8MB in the end (delta: 2.6kB). 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=50) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=50) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [unknown-#in~cond-unknown=0] [L17] COND TRUE !(cond) VAL [cond=0, unknown-#in~cond-unknown=0] [L19] reach_error() VAL [cond=0, unknown-#in~cond-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 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=13occurred 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 15:56:44,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- 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 15:56:47,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:56:47,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:56:47,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:56:47,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:56:47,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:56:47,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:56:47,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:56:47,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:56:47,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:56:47,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:56:47,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:56:47,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:56:47,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:56:47,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:56:47,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:56:47,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:56:47,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:56:47,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:56:47,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:56:47,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:56:47,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:56:47,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:56:47,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:56:47,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:56:47,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:56:47,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:56:47,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:56:47,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:56:47,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:56:47,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:56:47,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:56:47,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:56:47,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:56:47,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:56:47,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:56:47,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:56:47,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:56:47,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:56:47,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:56:47,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:56:47,379 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-23 15:56:47,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:56:47,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:56:47,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:56:47,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:56:47,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:56:47,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:56:47,427 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:56:47,427 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:56:47,428 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:56:47,428 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:56:47,429 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:56:47,429 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:56:47,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:56:47,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:56:47,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:56:47,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:56:47,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:56:47,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:56:47,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:56:47,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:56:47,433 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:56:47,433 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:56:47,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:56:47,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:56:47,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:56:47,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:56:47,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:56:47,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:56:47,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:56:47,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:56:47,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:56:47,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:56:47,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:56:47,437 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:56:47,438 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:56:47,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:56:47,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:56:47,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:56:47,439 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2022-11-23 15:56:47,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:56:47,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:56:47,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:56:47,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:56:47,895 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:56:47,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-11-23 15:56:51,201 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:56:51,422 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:56:51,423 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-11-23 15:56:51,429 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/2ae9c5119/a6d8e53329f44b859252ecd8d8478eef/FLAGc31863623 [2022-11-23 15:56:51,443 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/data/2ae9c5119/a6d8e53329f44b859252ecd8d8478eef [2022-11-23 15:56:51,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:56:51,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:56:51,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:56:51,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:56:51,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:56:51,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6fb8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51, skipping insertion in model container [2022-11-23 15:56:51,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:56:51,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:56:51,627 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2022-11-23 15:56:51,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:56:51,656 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:56:51,670 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_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2022-11-23 15:56:51,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:56:51,690 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:56:51,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51 WrapperNode [2022-11-23 15:56:51,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:56:51,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:56:51,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:56:51,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:56:51,700 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:56:51" (1/1) ... [2022-11-23 15:56:51,709 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:56:51" (1/1) ... [2022-11-23 15:56:51,727 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-11-23 15:56:51,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:56:51,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:56:51,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:56:51,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:56:51,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:56:51,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:56:51,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:56:51,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:56:51,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (1/1) ... [2022-11-23 15:56:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:56:51,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:56:51,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:56:51,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:56:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:56:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:56:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:56:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:56:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 15:56:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 15:56:51,931 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:56:51,933 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:56:52,722 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:56:52,728 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:56:52,728 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 15:56:52,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:52 BoogieIcfgContainer [2022-11-23 15:56:52,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:56:52,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:56:52,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:56:52,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:56:52,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:51" (1/3) ... [2022-11-23 15:56:52,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0a5f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:52, skipping insertion in model container [2022-11-23 15:56:52,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:51" (2/3) ... [2022-11-23 15:56:52,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0a5f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:52, skipping insertion in model container [2022-11-23 15:56:52,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:52" (3/3) ... [2022-11-23 15:56:52,740 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2022-11-23 15:56:52,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:56:52,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:56:52,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:56:52,816 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=FINITE_AUTOMATA, 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;@17ea4b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:56:52,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:56:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:56:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 15:56:52,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:56:52,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:56:52,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:56:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:56:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-11-23 15:56:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:56:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949816220] [2022-11-23 15:56:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:56:52,849 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 15:56:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:56:52,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:52,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:56:53,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 15:56:53,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:56:53,468 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 15:56:53,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:56:53,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:56:53,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949816220] [2022-11-23 15:56:53,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949816220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:56:53,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:56:53,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:56:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38503776] [2022-11-23 15:56:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:56:53,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:56:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:56:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:56:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:56:53,520 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:56:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:56:53,539 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-23 15:56:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:56:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 15:56:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:56:53,549 INFO L225 Difference]: With dead ends: 33 [2022-11-23 15:56:53,549 INFO L226 Difference]: Without dead ends: 14 [2022-11-23 15:56:53,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:56:53,556 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:56:53,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:56:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-23 15:56:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-23 15:56:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 15:56:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-23 15:56:53,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-23 15:56:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:56:53,592 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-23 15:56:53,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:56:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-23 15:56:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 15:56:53,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:56:53,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:56:53,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:53,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:53,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:56:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:56:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-11-23 15:56:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:56:53,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974079058] [2022-11-23 15:56:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:56:53,796 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 15:56:53,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:56:53,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:53,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:56:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:56:54,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:56:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:56:54,575 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Invalid model [2022-11-23 15:56:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [316041741] [2022-11-23 15:56:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:56:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:56:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:56:54,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:56:54,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-23 15:56:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:56:55,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 15:56:55,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:57:09,720 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:57:43,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32)) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) is different from false [2022-11-23 15:58:12,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32)) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))))) is different from false [2022-11-23 15:58:28,966 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from false [2022-11-23 15:58:31,000 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2022-11-23 15:58:31,001 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 15:58:31,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:58:31,002 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:58:31,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974079058] [2022-11-23 15:58:31,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:58:31,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [316041741] [2022-11-23 15:58:31,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [316041741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:58:31,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:58:31,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:58:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586811439] [2022-11-23 15:58:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:58:31,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:58:31,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:58:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:58:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=4, NotChecked=30, Total=72 [2022-11-23 15:58:31,007 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:47,943 WARN L233 SmtUtils]: Spent 14.64s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:58:50,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:58:52,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:58:54,410 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2)))) (_ bv0 32)) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-23 15:58:56,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:58:58,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:59:01,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:59:03,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:59:06,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:59:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:59:07,531 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-23 15:59:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:59:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 15:59:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:59:07,553 INFO L225 Difference]: With dead ends: 30 [2022-11-23 15:59:07,553 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 15:59:07,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=33, Invalid=34, Unknown=5, NotChecked=60, Total=132 [2022-11-23 15:59:07,555 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:59:07,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 5 Unknown, 61 Unchecked, 18.2s Time] [2022-11-23 15:59:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 15:59:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-23 15:59:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:59:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-23 15:59:07,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2022-11-23 15:59:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:59:07,568 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-23 15:59:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:59:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-23 15:59:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:59:07,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:59:07,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:59:07,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:59:07,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:59:07,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 15:59:07,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:59:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:59:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2022-11-23 15:59:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:59:07,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433311539] [2022-11-23 15:59:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:59:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:59:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:59:07,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:59:07,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 15:59:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:59:08,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:59:08,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:59:14,673 WARN L837 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-11-23 15:59:16,734 WARN L859 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-11-23 15:59:29,137 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-23 15:59:37,419 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-11-23 15:59:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 15:59:37,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:00:02,280 WARN L233 SmtUtils]: Spent 16.47s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:00:18,760 WARN L233 SmtUtils]: Spent 16.48s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:00:25,007 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:00:35,412 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:00:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:00:35,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:00:35,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433311539] [2022-11-23 16:00:35,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433311539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:00:35,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191784098] [2022-11-23 16:00:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:00:35,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 16:00:35,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 16:00:35,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 16:00:35,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-23 16:00:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:00:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:00:35,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:00:52,191 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-23 16:01:00,468 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32)))) is different from false [2022-11-23 16:01:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:01:00,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:01:25,305 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:01:41,807 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:01:48,043 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:01:58,426 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:01:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:01:58,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [191784098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:01:58,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913964100] [2022-11-23 16:01:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:01:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:01:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:01:58,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:01:58,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 16:01:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:01:58,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:01:58,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:02:15,332 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-23 16:02:23,620 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)))))) is different from false [2022-11-23 16:02:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:02:23,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:02:48,729 WARN L233 SmtUtils]: Spent 16.75s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:03:05,468 WARN L233 SmtUtils]: Spent 16.74s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:03:11,703 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:03:22,113 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-23 16:03:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:03:22,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913964100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:03:22,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 16:03:22,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2022-11-23 16:03:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948574151] [2022-11-23 16:03:22,118 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 16:03:22,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 16:03:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:03:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 16:03:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2022-11-23 16:03:22,120 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 16:03:24,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 16:03:26,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 16:03:28,554 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2))) is different from true [2022-11-23 16:03:30,744 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1) .cse1)) is different from true [2022-11-23 16:03:32,933 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-11-23 16:03:35,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from false [2022-11-23 16:03:37,316 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from true [2022-11-23 16:03:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:03:37,320 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-11-23 16:03:37,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:03:37,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 15 [2022-11-23 16:03:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:03:37,321 INFO L225 Difference]: With dead ends: 32 [2022-11-23 16:03:37,322 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 16:03:37,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2022-11-23 16:03:37,324 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:03:37,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 82 Unchecked, 4.2s Time] [2022-11-23 16:03:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 16:03:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-23 16:03:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 16:03:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-23 16:03:37,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2022-11-23 16:03:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:03:37,332 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-23 16:03:37,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 16:03:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-23 16:03:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:03:37,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:03:37,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:03:37,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 16:03:37,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:03:37,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:03:37,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 16:03:37,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:03:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:03:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-11-23 16:03:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:03:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543531502] [2022-11-23 16:03:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:03:37,940 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 16:03:37,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:03:37,942 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 16:03:37,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/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 (8)] Waiting until timeout for monitored process [2022-11-23 16:03:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:03:38,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 16:03:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:03:39,521 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Invalid model [2022-11-23 16:03:39,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [88015588] [2022-11-23 16:03:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:03:39,521 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 16:03:39,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 16:03:39,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 16:03:39,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-23 16:03:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:03:46,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 16:03:46,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:04:05,122 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:04:34,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.gt .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-23 16:04:36,782 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.gt .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-23 16:05:19,547 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3)))) (_ bv0 32)) (fp.gt .cse6 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4)))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) is different from false [2022-11-23 16:05:51,298 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32)) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4))))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse5))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3)))) (_ bv0 32))) (fp.gt .cse6 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4)))) (= (_ bv0 32) c___VERIFIER_assert_~cond)))) is different from false [2022-11-23 16:06:08,188 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from false [2022-11-23 16:06:10,243 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2022-11-23 16:06:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-23 16:06:10,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:06:18,658 WARN L837 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-11-23 16:06:20,724 WARN L859 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-11-23 16:06:35,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from false [2022-11-23 16:06:37,619 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from true [2022-11-23 16:07:05,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from false [2022-11-23 16:07:07,364 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from true [2022-11-23 16:07:22,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from false [2022-11-23 16:07:24,258 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from true [2022-11-23 16:07:40,159 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_15|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from false [2022-11-23 16:07:42,228 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_15|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from true [2022-11-23 16:07:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 16:07:42,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:07:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543531502] [2022-11-23 16:07:42,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 16:07:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88015588] [2022-11-23 16:07:42,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [88015588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:07:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255272879] [2022-11-23 16:07:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:42,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:07:42,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:07:42,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:07:42,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_286b9465-6b88-4c94-8bb1-6a4a2351ba4f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process