./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- 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-5e519f3 [2022-11-03 01:42:13,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:42:13,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:42:13,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:42:13,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:42:13,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:42:13,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:42:13,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:42:13,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:42:13,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:42:13,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:42:13,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:42:13,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:42:13,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:42:13,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:42:13,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:42:13,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:42:13,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:42:13,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:42:13,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:42:13,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:42:13,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:42:13,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:42:13,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:42:13,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:42:13,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:42:13,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:42:13,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:42:13,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:42:13,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:42:13,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:42:13,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:42:13,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:42:13,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:42:13,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:42:13,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:42:13,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:42:13,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:42:13,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:42:13,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:42:13,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:42:13,957 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:42:13,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:42:13,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:42:13,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:42:13,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:42:13,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:42:13,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:42:13,998 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:42:13,998 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:42:13,999 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:42:13,999 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:42:14,000 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:42:14,000 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:42:14,001 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:42:14,001 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:42:14,001 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:42:14,002 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:42:14,002 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:42:14,002 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:42:14,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:42:14,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:42:14,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:42:14,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:42:14,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:42:14,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:42:14,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:42:14,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:42:14,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:42:14,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:42:14,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:42:14,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:42:14,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:42:14,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:42:14,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:42:14,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:42:14,010 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:42:14,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:42:14,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:42:14,011 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:42:14,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:42:14,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:42:14,012 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:42:14,012 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2022-11-03 01:42:14,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:42:14,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:42:14,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:42:14,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:42:14,344 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:42:14,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:14,450 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/e19ff8756/5844d029db4a443d8fd1f192e3d5895c/FLAG19469de76 [2022-11-03 01:42:14,911 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:42:14,911 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:14,919 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/e19ff8756/5844d029db4a443d8fd1f192e3d5895c/FLAG19469de76 [2022-11-03 01:42:15,304 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/e19ff8756/5844d029db4a443d8fd1f192e3d5895c [2022-11-03 01:42:15,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:42:15,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:42:15,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:42:15,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:42:15,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:42:15,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414d8238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15, skipping insertion in model container [2022-11-03 01:42:15,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:42:15,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:42:15,621 WARN L230 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2022-11-03 01:42:15,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:42:15,636 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:42:15,677 WARN L230 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2022-11-03 01:42:15,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:42:15,698 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:42:15,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15 WrapperNode [2022-11-03 01:42:15,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:42:15,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:42:15,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:42:15,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:42:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,742 INFO L138 Inliner]: procedures = 18, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2022-11-03 01:42:15,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:42:15,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:42:15,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:42:15,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:42:15,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:42:15,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:42:15,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:42:15,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:42:15,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (1/1) ... [2022-11-03 01:42:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:42:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:15,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:42:15,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:42:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:42:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:42:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:42:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 01:42:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:42:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:42:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-03 01:42:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:42:15,990 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:42:15,992 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:42:16,336 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:42:16,352 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:42:16,352 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:42:16,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:42:16 BoogieIcfgContainer [2022-11-03 01:42:16,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:42:16,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:42:16,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:42:16,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:42:16,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:42:15" (1/3) ... [2022-11-03 01:42:16,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642262ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:42:16, skipping insertion in model container [2022-11-03 01:42:16,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:15" (2/3) ... [2022-11-03 01:42:16,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642262ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:42:16, skipping insertion in model container [2022-11-03 01:42:16,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:42:16" (3/3) ... [2022-11-03 01:42:16,365 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:16,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:42:16,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:42:16,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:42:16,458 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;@677ee5f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:42:16,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:42:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:42:16,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:16,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:16,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2022-11-03 01:42:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:16,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967240159] [2022-11-03 01:42:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:16,857 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-03 01:42:16,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967240159] [2022-11-03 01:42:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967240159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:42:16,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:42:16,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:42:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282456748] [2022-11-03 01:42:16,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:42:16,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:42:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:42:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:42:16,905 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:16,985 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-11-03 01:42:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:42:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 01:42:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:16,996 INFO L225 Difference]: With dead ends: 35 [2022-11-03 01:42:16,996 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 01:42:16,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:42:17,002 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:17,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:42:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 01:42:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 01:42:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-03 01:42:17,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-11-03 01:42:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:17,036 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-03 01:42:17,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-03 01:42:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:42:17,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:17,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:17,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:42:17,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2022-11-03 01:42:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380223027] [2022-11-03 01:42:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:42:17,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:42:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:42:17,096 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:42:17,097 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:42:17,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:42:17,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:42:17,104 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 01:42:17,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:42:17,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:42:17 BoogieIcfgContainer [2022-11-03 01:42:17,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:42:17,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:42:17,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:42:17,142 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:42:17,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:42:16" (3/4) ... [2022-11-03 01:42:17,146 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 01:42:17,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:42:17,147 INFO L158 Benchmark]: Toolchain (without parser) took 1834.68ms. Allocated memory is still 119.5MB. Free memory was 87.6MB in the beginning and 39.6MB in the end (delta: 48.0MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,149 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 79.7MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 38.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:42:17,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.41ms. Allocated memory is still 119.5MB. Free memory was 87.5MB in the beginning and 95.6MB in the end (delta: -8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.04ms. Allocated memory is still 119.5MB. Free memory was 95.6MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,158 INFO L158 Benchmark]: Boogie Preprocessor took 28.48ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,159 INFO L158 Benchmark]: RCFGBuilder took 583.35ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 76.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,162 INFO L158 Benchmark]: TraceAbstraction took 783.52ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 40.3MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-03 01:42:17,164 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 119.5MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:42:17,166 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.27ms. Allocated memory is still 79.7MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 38.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.41ms. Allocated memory is still 119.5MB. Free memory was 87.5MB in the beginning and 95.6MB in the end (delta: -8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.04ms. Allocated memory is still 119.5MB. Free memory was 95.6MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.48ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 583.35ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 76.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 783.52ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 40.3MB in the end (delta: 35.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 119.5MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0, main__max={6:0}, main__min={7:0}, main__min[0]=58, main__org={4:0}, main__slope={5:0}] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0, main__max={6:0}, main__max[4UL]=59, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__max[main__i]=57, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L34] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_136=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_136=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L53] reach_error() VAL [__return_136=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-03 01:42:17,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- 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-5e519f3 [2022-11-03 01:42:19,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:42:19,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:42:19,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:42:19,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:42:19,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:42:19,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:42:19,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:42:19,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:42:19,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:42:19,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:42:19,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:42:19,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:42:19,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:42:19,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:42:19,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:42:19,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:42:19,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:42:19,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:42:19,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:42:19,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:42:19,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:42:19,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:42:19,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:42:19,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:42:19,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:42:19,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:42:19,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:42:19,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:42:19,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:42:19,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:42:19,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:42:19,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:42:19,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:42:19,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:42:19,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:42:19,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:42:19,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:42:19,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:42:19,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:42:19,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:42:19,685 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 01:42:19,727 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:42:19,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:42:19,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:42:19,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:42:19,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:42:19,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:42:19,731 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:42:19,731 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:42:19,731 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:42:19,731 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:42:19,733 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:42:19,733 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:42:19,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:42:19,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:42:19,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:42:19,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:42:19,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:42:19,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:42:19,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:42:19,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:42:19,737 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:42:19,737 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:42:19,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:42:19,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:42:19,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:42:19,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:42:19,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:42:19,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:42:19,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:42:19,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:42:19,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:42:19,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:42:19,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:42:19,741 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:42:19,741 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:42:19,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:42:19,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:42:19,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:42:19,742 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2022-11-03 01:42:20,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:42:20,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:42:20,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:42:20,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:42:20,139 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:42:20,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:20,219 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/9c9374e0c/e72844671f6a419c99ccef4060fc578f/FLAGbe1b3d232 [2022-11-03 01:42:20,871 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:42:20,872 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:20,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/9c9374e0c/e72844671f6a419c99ccef4060fc578f/FLAGbe1b3d232 [2022-11-03 01:42:21,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/data/9c9374e0c/e72844671f6a419c99ccef4060fc578f [2022-11-03 01:42:21,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:42:21,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:42:21,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:42:21,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:42:21,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:42:21,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38028536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21, skipping insertion in model container [2022-11-03 01:42:21,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:42:21,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:42:21,536 WARN L230 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2022-11-03 01:42:21,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:42:21,558 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:42:21,601 WARN L230 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_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2022-11-03 01:42:21,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:42:21,630 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:42:21,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21 WrapperNode [2022-11-03 01:42:21,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:42:21,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:42:21,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:42:21,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:42:21,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,700 INFO L138 Inliner]: procedures = 19, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 200 [2022-11-03 01:42:21,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:42:21,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:42:21,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:42:21,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:42:21,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,732 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:42:21,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:42:21,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:42:21,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:42:21,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (1/1) ... [2022-11-03 01:42:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:42:21,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:21,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:42:21,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:42:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:42:21,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-11-03 01:42:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:42:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:42:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-11-03 01:42:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:42:21,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:42:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:42:21,912 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:42:21,914 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:42:24,759 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:42:24,764 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:42:24,765 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:42:24,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:42:24 BoogieIcfgContainer [2022-11-03 01:42:24,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:42:24,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:42:24,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:42:24,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:42:24,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:42:21" (1/3) ... [2022-11-03 01:42:24,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4490cc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:42:24, skipping insertion in model container [2022-11-03 01:42:24,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:42:21" (2/3) ... [2022-11-03 01:42:24,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4490cc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:42:24, skipping insertion in model container [2022-11-03 01:42:24,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:42:24" (3/3) ... [2022-11-03 01:42:24,775 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2022-11-03 01:42:24,793 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:42:24,793 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:42:24,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:42:24,848 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;@6eb1bc76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:42:24,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:42:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:42:24,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:24,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:24,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-11-03 01:42:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:42:24,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92489385] [2022-11-03 01:42:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:42:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:42:24,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:42:24,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:42:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:25,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:42:25,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:25,596 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-03 01:42:25,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:42:25,597 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:42:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92489385] [2022-11-03 01:42:25,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92489385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:42:25,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:42:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:42:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337997353] [2022-11-03 01:42:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:42:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:42:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:42:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:42:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:42:25,654 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:27,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:28,120 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-11-03 01:42:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:42:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 01:42:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:28,137 INFO L225 Difference]: With dead ends: 35 [2022-11-03 01:42:28,137 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 01:42:28,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:42:28,143 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:28,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 01:42:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 01:42:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 01:42:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-03 01:42:28,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-11-03 01:42:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:28,185 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-03 01:42:28,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:42:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-11-03 01:42:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:42:28,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:28,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:28,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:42:28,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2022-11-03 01:42:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:42:28,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609260966] [2022-11-03 01:42:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:28,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:42:28,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:42:28,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:42:28,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:42:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:29,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 01:42:29,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:36,504 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-11-03 01:42:36,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2022-11-03 01:43:03,364 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse2) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1)))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 01:43:36,496 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from false [2022-11-03 01:43:38,523 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from true [2022-11-03 01:45:09,544 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-03 01:45:09,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:09,545 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:09,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609260966] [2022-11-03 01:45:09,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609260966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:09,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:09,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:45:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738984104] [2022-11-03 01:45:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:45:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:45:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2022-11-03 01:45:09,549 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:11,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:45:14,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse6 (let ((.cse16 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= .cse0 (let ((.cse1 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= .cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse6) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= .cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse12 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse11 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse4 .cse7) (= .cse8 .cse9) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse9) (= .cse10 .cse11) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse11 .cse9)))) (= .cse12 .cse13) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse11)))) (= .cse10 (let ((.cse14 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (= .cse13 (let ((.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= .cse8 .cse6) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 01:45:16,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:45:18,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:45:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:19,623 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-03 01:45:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:45:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 01:45:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:19,626 INFO L225 Difference]: With dead ends: 31 [2022-11-03 01:45:19,626 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 01:45:19,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2022-11-03 01:45:19,628 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:19,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 2 Unknown, 54 Unchecked, 7.9s Time] [2022-11-03 01:45:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 01:45:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-03 01:45:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-03 01:45:19,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2022-11-03 01:45:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:19,637 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-03 01:45:19,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-03 01:45:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:45:19,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:19,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:19,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:19,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:45:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2022-11-03 01:45:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041042841] [2022-11-03 01:45:19,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:19,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:19,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:19,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 01:45:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:21,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:45:21,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:28,029 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-11-03 01:45:28,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2022-11-03 01:45:49,811 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 01:46:16,635 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 01:46:52,984 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from false [2022-11-03 01:46:55,017 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from true [2022-11-03 01:48:02,214 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from false [2022-11-03 01:48:04,243 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from true [2022-11-03 01:48:35,289 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-03 01:48:35,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:48:35,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:48:35,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041042841] [2022-11-03 01:48:35,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041042841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:35,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:35,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:48:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635007328] [2022-11-03 01:48:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:48:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:48:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:48:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-11-03 01:48:35,292 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:37,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:48:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:38,377 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-03 01:48:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:48:38,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:48:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:38,379 INFO L225 Difference]: With dead ends: 30 [2022-11-03 01:48:38,379 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 01:48:38,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-11-03 01:48:38,381 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:38,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 20 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 1 Unknown, 87 Unchecked, 3.1s Time] [2022-11-03 01:48:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 01:48:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 01:48:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-03 01:48:38,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-11-03 01:48:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:38,387 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-03 01:48:38,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-03 01:48:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:48:38,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:38,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:38,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-03 01:48:38,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:48:38,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:48:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash -252887217, now seen corresponding path program 1 times [2022-11-03 01:48:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:48:38,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422338683] [2022-11-03 01:48:38,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:38,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:48:38,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:48:38,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:48:38,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 01:48:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:39,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 01:48:39,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:46,034 INFO L356 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-03 01:48:46,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 313 treesize of output 169 [2022-11-03 01:49:12,888 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse4) (= (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0))) |c_ULTIMATE.start_main_~main__z~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse5) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse1 .cse6) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6))))) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) .cse3)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 01:49:14,910 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse4) (= (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0))) |c_ULTIMATE.start_main_~main__z~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse5) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse1 .cse6) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6))))) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) .cse3)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-03 01:49:51,200 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse1 .cse5) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5))))) is different from false [2022-11-03 01:49:53,224 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse1 .cse5) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5))))) is different from true [2022-11-03 01:51:37,269 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-03 01:51:37,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:51:37,269 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:51:37,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422338683] [2022-11-03 01:51:37,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422338683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:51:37,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:51:37,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:51:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371984230] [2022-11-03 01:51:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:51:37,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:51:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:51:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:51:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=75, Unknown=4, NotChecked=38, Total=156 [2022-11-03 01:51:37,272 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:51:39,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:51:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:40,575 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-03 01:51:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:51:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:51:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:40,577 INFO L225 Difference]: With dead ends: 29 [2022-11-03 01:51:40,577 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 01:51:40,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=39, Invalid=75, Unknown=4, NotChecked=38, Total=156 [2022-11-03 01:51:40,578 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:40,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 16 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 1 Unknown, 45 Unchecked, 3.3s Time] [2022-11-03 01:51:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 01:51:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 01:51:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:51:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-03 01:51:40,585 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-11-03 01:51:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-03 01:51:40,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:51:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-03 01:51:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 01:51:40,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:40,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:40,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:51:40,789 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:51:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash 233583923, now seen corresponding path program 1 times [2022-11-03 01:51:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:51:40,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810821866] [2022-11-03 01:51:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:51:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:51:40,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:51:40,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 01:51:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:42,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:51:42,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:50,695 INFO L356 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-03 01:51:50,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 313 treesize of output 169 [2022-11-03 01:52:19,091 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) .cse0)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22)))) (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))) (and (= .cse1 .cse2) (= .cse3 .cse0) (= .cse1 .cse4) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse6) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse5 .cse2)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 01:52:53,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) .cse0)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22)))) (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))) (and (= .cse1 .cse2) (= .cse3 .cse0) (= .cse1 .cse4) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse6) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse5 .cse2)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 01:53:35,025 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse6)) (fp.sub roundNearestTiesToEven .cse2 .cse6))))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse5 .cse3) (= .cse6 .cse5))))) is different from false [2022-11-03 01:53:47,964 WARN L234 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 32 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:53:47,973 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-03 01:53:47,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:53:47,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:53:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810821866] [2022-11-03 01:53:47,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810821866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:47,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:47,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 01:53:47,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683447946] [2022-11-03 01:53:47,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:47,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:53:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:53:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:53:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=78, Unknown=3, NotChecked=60, Total=182 [2022-11-03 01:53:47,976 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:50,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:53:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:51,185 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-03 01:53:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:53:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 01:53:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:51,187 INFO L225 Difference]: With dead ends: 30 [2022-11-03 01:53:51,187 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 01:53:51,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=41, Invalid=78, Unknown=3, NotChecked=60, Total=182 [2022-11-03 01:53:51,188 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:51,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 1 Unknown, 57 Unchecked, 3.2s Time] [2022-11-03 01:53:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 01:53:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 01:53:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-03 01:53:51,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2022-11-03 01:53:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:51,193 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-03 01:53:51,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-03 01:53:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:53:51,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:51,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:51,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-03 01:53:51,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:53:51,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1916934988, now seen corresponding path program 1 times [2022-11-03 01:53:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:53:51,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395668763] [2022-11-03 01:53:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:53:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:53:51,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:53:51,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 01:53:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:52,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:53:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:00,302 INFO L356 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-03 01:54:00,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 336 treesize of output 180 [2022-11-03 01:54:30,874 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_28 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_28) ((_ extract 30 23) v_arrayElimCell_28) ((_ extract 22 0) v_arrayElimCell_28)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv40 32)) .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967286 32)) .cse5) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_31) ((_ extract 30 23) v_arrayElimCell_31) ((_ extract 22 0) v_arrayElimCell_31)))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 01:55:07,519 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967286 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse4) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse4 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv40 32)) .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)))) is different from false [2022-11-03 01:55:09,553 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967286 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse4) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse4 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv40 32)) .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)))) is different from true [2022-11-03 01:56:54,157 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-03 01:56:54,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:56:54,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:56:54,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395668763] [2022-11-03 01:56:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395668763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:54,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:54,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 01:56:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967742637] [2022-11-03 01:56:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:54,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:56:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:56:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:56:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=113, Unknown=3, NotChecked=46, Total=210 [2022-11-03 01:56:54,159 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:56:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:57,688 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-03 01:56:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:56:57,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 01:56:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:57,691 INFO L225 Difference]: With dead ends: 30 [2022-11-03 01:56:57,691 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 01:56:57,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=48, Invalid=113, Unknown=3, NotChecked=46, Total=210 [2022-11-03 01:56:57,693 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:57,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 1 Unknown, 42 Unchecked, 3.5s Time] [2022-11-03 01:56:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 01:56:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-03 01:56:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-03 01:56:57,701 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-11-03 01:56:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:57,701 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-03 01:56:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-03 01:56:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:56:57,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:57,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:57,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:57,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:56:57,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash 187710574, now seen corresponding path program 1 times [2022-11-03 01:56:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:56:57,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122399673] [2022-11-03 01:56:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:57,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:56:57,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:56:57,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:56:57,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7c184e1-0d03-40bf-8f3f-75b2f90f9a45/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 01:56:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:59,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:56:59,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:08,794 INFO L356 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-03 01:57:08,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 336 treesize of output 180 [2022-11-03 01:57:40,818 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_36 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_36) ((_ extract 30 23) v_arrayElimCell_36) ((_ extract 22 0) v_arrayElimCell_36)))) (exists ((v_arrayElimCell_34 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_34) ((_ extract 30 23) v_arrayElimCell_34) ((_ extract 22 0) v_arrayElimCell_34)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (exists ((v_arrayElimCell_39 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_39) ((_ extract 30 23) v_arrayElimCell_39) ((_ extract 22 0) v_arrayElimCell_39)))) (exists ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_33 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_40) ((_ extract 30 23) v_arrayElimCell_40) ((_ extract 22 0) v_arrayElimCell_40))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_33) ((_ extract 30 23) v_arrayElimCell_33) ((_ extract 22 0) v_arrayElimCell_33))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_38) ((_ extract 30 23) v_arrayElimCell_38) ((_ extract 22 0) v_arrayElimCell_38))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_35) ((_ extract 30 23) v_arrayElimCell_35) ((_ extract 22 0) v_arrayElimCell_35))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_37) ((_ extract 30 23) v_arrayElimCell_37) ((_ extract 22 0) v_arrayElimCell_37)))) (and (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv40 32))) (= .cse2 .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32)) .cse4) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse4 .cse2)))) (= .cse0 .cse3) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967286 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false