./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur --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 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d --- 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-38b53e6 [2022-11-26 00:52:15,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:52:15,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:52:15,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:52:15,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:52:15,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:52:15,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:52:15,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:52:15,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:52:15,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:52:15,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:52:15,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:52:15,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:52:15,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:52:15,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:52:15,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:52:15,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:52:15,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:52:15,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:52:15,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:52:15,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:52:15,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:52:15,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:52:15,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:52:15,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:52:15,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:52:15,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:52:15,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:52:15,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:52:15,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:52:15,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:52:15,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:52:15,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:52:15,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:52:15,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:52:15,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:52:15,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:52:15,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:52:15,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:52:15,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:52:15,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:52:15,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:52:15,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:52:15,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:52:15,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:52:15,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:52:15,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:52:15,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:52:15,677 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:52:15,678 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:52:15,678 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:52:15,678 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:52:15,680 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:52:15,680 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:52:15,680 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:52:15,681 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:52:15,681 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:52:15,681 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:52:15,681 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:52:15,682 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:52:15,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:52:15,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:52:15,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:52:15,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:52:15,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:52:15,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:52:15,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:52:15,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:52:15,685 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:52:15,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:52:15,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:52:15,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:52:15,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:52:15,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:52:15,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:15,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:52:15,688 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:52:15,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:52:15,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:52:15,689 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:52:15,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:52:15,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:52:15,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:52:15,691 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_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/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_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur 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 -> 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d [2022-11-26 00:52:16,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:52:16,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:52:16,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:52:16,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:52:16,068 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:52:16,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2022-11-26 00:52:19,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:52:19,839 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:52:19,839 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2022-11-26 00:52:19,847 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/d391f140c/7715ac2e5f1346808896d4c93000dc59/FLAG8a428b128 [2022-11-26 00:52:19,865 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/d391f140c/7715ac2e5f1346808896d4c93000dc59 [2022-11-26 00:52:19,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:52:19,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:52:19,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:19,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:52:19,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:52:19,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:19" (1/1) ... [2022-11-26 00:52:19,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47056862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:19, skipping insertion in model container [2022-11-26 00:52:19,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:19" (1/1) ... [2022-11-26 00:52:19,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:52:19,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:52:20,096 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-11-26 00:52:20,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:20,126 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:52:20,141 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-11-26 00:52:20,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:20,161 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:52:20,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20 WrapperNode [2022-11-26 00:52:20,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:20,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:20,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:52:20,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:52:20,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,208 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-11-26 00:52:20,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:20,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:52:20,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:52:20,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:52:20,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:52:20,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:52:20,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:52:20,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:52:20,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (1/1) ... [2022-11-26 00:52:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:20,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:20,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:52:20,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:52:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:52:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:52:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:52:20,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:52:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 00:52:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 00:52:20,488 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:52:20,494 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:52:20,639 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:52:20,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:52:20,681 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:52:20,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:52:20 BoogieIcfgContainer [2022-11-26 00:52:20,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:52:20,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:52:20,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:52:20,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:52:20,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:52:19" (1/3) ... [2022-11-26 00:52:20,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf1586a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:52:20, skipping insertion in model container [2022-11-26 00:52:20,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:20" (2/3) ... [2022-11-26 00:52:20,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf1586a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:52:20, skipping insertion in model container [2022-11-26 00:52:20,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:52:20" (3/3) ... [2022-11-26 00:52:20,698 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound2.c [2022-11-26 00:52:20,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:52:20,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:52:20,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:52:20,801 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;@4afb5e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:52:20,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:52:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:52:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:52:20,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:20,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:52:20,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522412, now seen corresponding path program 1 times [2022-11-26 00:52:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:20,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010149327] [2022-11-26 00:52:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:52:20,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:52:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:52:21,009 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:52:21,012 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:52:21,013 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:52:21,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:52:21,022 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-26 00:52:21,028 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:52:21,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:52:21 BoogieIcfgContainer [2022-11-26 00:52:21,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:52:21,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:52:21,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:52:21,051 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:52:21,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:52:20" (3/4) ... [2022-11-26 00:52:21,056 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 00:52:21,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:52:21,058 INFO L158 Benchmark]: Toolchain (without parser) took 1187.49ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 81.5MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-26 00:52:21,059 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 151.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:52:21,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.08ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 109.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:52:21,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.85ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:52:21,061 INFO L158 Benchmark]: Boogie Preprocessor took 60.55ms. Allocated memory is still 151.0MB. Free memory was 108.0MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:52:21,062 INFO L158 Benchmark]: RCFGBuilder took 413.83ms. Allocated memory is still 151.0MB. Free memory was 106.7MB in the beginning and 96.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:52:21,063 INFO L158 Benchmark]: TraceAbstraction took 361.92ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 81.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:52:21,064 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 151.0MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:52:21,067 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.37ms. Allocated memory is still 151.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.08ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 109.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.85ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.55ms. Allocated memory is still 151.0MB. Free memory was 108.0MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 413.83ms. Allocated memory is still 151.0MB. Free memory was 106.7MB in the beginning and 96.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 361.92ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 81.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 151.0MB. Free memory is still 81.5MB. 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=2) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=2) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-26 00:52:21,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur --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 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d --- 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-38b53e6 [2022-11-26 00:52:24,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:52:24,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:52:24,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:52:24,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:52:24,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:52:24,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:52:24,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:52:24,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:52:24,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:52:24,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:52:24,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:52:24,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:52:24,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:52:24,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:52:24,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:52:24,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:52:24,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:52:24,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:52:24,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:52:24,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:52:24,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:52:24,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:52:24,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:52:24,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:52:24,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:52:24,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:52:24,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:52:24,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:52:24,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:52:24,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:52:24,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:52:24,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:52:24,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:52:24,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:52:24,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:52:24,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:52:24,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:52:24,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:52:24,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:52:24,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:52:24,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-26 00:52:24,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:52:24,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:52:24,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:52:24,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:52:24,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:52:24,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:52:24,266 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:52:24,267 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:52:24,267 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:52:24,267 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:52:24,269 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:52:24,269 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:52:24,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:52:24,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:52:24,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:52:24,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:52:24,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:52:24,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:52:24,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:52:24,272 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:52:24,272 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:52:24,273 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:52:24,273 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:52:24,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:52:24,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:52:24,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:52:24,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:52:24,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:52:24,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:52:24,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:24,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:52:24,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:52:24,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:52:24,276 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:52:24,277 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:52:24,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:52:24,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:52:24,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:52:24,278 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_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/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_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur 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 -> 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d [2022-11-26 00:52:24,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:52:24,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:52:24,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:52:24,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:52:24,840 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:52:24,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2022-11-26 00:52:28,644 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:52:28,956 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:52:28,957 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2022-11-26 00:52:28,965 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/247151db4/e65f8eeb55dd456398cd53b3acb2bb24/FLAG5aa196afc [2022-11-26 00:52:28,990 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/data/247151db4/e65f8eeb55dd456398cd53b3acb2bb24 [2022-11-26 00:52:28,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:52:28,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:52:29,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:29,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:52:29,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:52:29,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:28" (1/1) ... [2022-11-26 00:52:29,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d004f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29, skipping insertion in model container [2022-11-26 00:52:29,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:28" (1/1) ... [2022-11-26 00:52:29,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:52:29,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:52:29,232 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-11-26 00:52:29,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:29,269 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:52:29,288 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2022-11-26 00:52:29,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:29,321 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:52:29,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29 WrapperNode [2022-11-26 00:52:29,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:29,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:29,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:52:29,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:52:29,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,359 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-11-26 00:52:29,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:29,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:52:29,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:52:29,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:52:29,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:52:29,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:52:29,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:52:29,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:52:29,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (1/1) ... [2022-11-26 00:52:29,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:29,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:52:29,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:52:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:52:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:52:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:52:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:52:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 00:52:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 00:52:29,615 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:52:29,617 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:52:31,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:52:31,076 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:52:31,077 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:52:31,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:52:31 BoogieIcfgContainer [2022-11-26 00:52:31,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:52:31,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:52:31,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:52:31,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:52:31,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:52:28" (1/3) ... [2022-11-26 00:52:31,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d9aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:52:31, skipping insertion in model container [2022-11-26 00:52:31,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:29" (2/3) ... [2022-11-26 00:52:31,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d9aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:52:31, skipping insertion in model container [2022-11-26 00:52:31,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:52:31" (3/3) ... [2022-11-26 00:52:31,099 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound2.c [2022-11-26 00:52:31,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:52:31,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:52:31,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:52:31,188 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;@1da85054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:52:31,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:52:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:52:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:52:31,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:31,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:52:31,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:31,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-11-26 00:52:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:52:31,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737897891] [2022-11-26 00:52:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:31,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:52:31,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:52:31,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:52:31,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 00:52:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:31,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-26 00:52:31,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:31,910 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-26 00:52:31,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:52:31,912 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:52:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737897891] [2022-11-26 00:52:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737897891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:31,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:52:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:52:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082359935] [2022-11-26 00:52:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:31,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:52:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:52:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:52:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:52:31,973 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:32,002 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-26 00:52:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:52:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:52:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:32,012 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:52:32,013 INFO L226 Difference]: Without dead ends: 14 [2022-11-26 00:52:32,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:52:32,023 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:32,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:52:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-26 00:52:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-26 00:52:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:52:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-26 00:52:32,066 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-26 00:52:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:32,066 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-26 00:52:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-26 00:52:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:52:32,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:32,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:52:32,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:52:32,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-11-26 00:52:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:52:32,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296262816] [2022-11-26 00:52:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:52:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:52:32,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:52:32,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 00:52:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:52:32,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:52:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:52:33,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Invalid model [2022-11-26 00:52:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [641794059] [2022-11-26 00:52:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:52:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:52:33,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:52:33,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-26 00:52:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:34,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:52:34,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:06,983 WARN L837 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-26 00:53:44,373 WARN L233 SmtUtils]: Spent 12.41s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:54:00,976 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2022-11-26 00:54:03,011 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2022-11-26 00:54:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:03,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:54:03,013 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:54:03,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296262816] [2022-11-26 00:54:03,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 00:54:03,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [641794059] [2022-11-26 00:54:03,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [641794059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:03,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:03,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:54:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964671429] [2022-11-26 00:54:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:03,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:54:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:54:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:54:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=24, Unknown=7, NotChecked=22, Total=72 [2022-11-26 00:54:03,018 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:17,422 WARN L233 SmtUtils]: Spent 12.65s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:54:19,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:54:21,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:23,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:25,868 WARN L837 $PredicateComparison]: unable to prove that (and (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-26 00:54:28,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:54:29,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:31,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:34,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:54:36,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:38,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:40,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:54:42,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:54:46,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:54:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:46,143 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-11-26 00:54:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:54:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:54:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:46,147 INFO L225 Difference]: With dead ends: 32 [2022-11-26 00:54:46,147 INFO L226 Difference]: Without dead ends: 30 [2022-11-26 00:54:46,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=33, Invalid=43, Unknown=8, NotChecked=48, Total=132 [2022-11-26 00:54:46,149 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:46,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 10 Unknown, 47 Unchecked, 26.9s Time] [2022-11-26 00:54:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-26 00:54:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2022-11-26 00:54:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:54:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-26 00:54:46,159 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 9 [2022-11-26 00:54:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:46,159 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-26 00:54:46,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-26 00:54:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:54:46,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:46,161 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:46,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:46,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:46,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:54:46,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:54:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2022-11-26 00:54:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:54:46,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843715114] [2022-11-26 00:54:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:46,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:54:46,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:54:46,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:54:46,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-26 00:54:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:47,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:54:47,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:53,385 WARN L837 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-11-26 00:54:55,454 WARN L859 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-11-26 00:55:07,888 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-26 00:55:16,192 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-11-26 00:55:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:55:16,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:41,221 WARN L233 SmtUtils]: Spent 16.53s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:55:57,773 WARN L233 SmtUtils]: Spent 16.55s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:56:04,046 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:56:14,484 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:56:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:56:14,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843715114] [2022-11-26 00:56:14,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843715114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1553952230] [2022-11-26 00:56:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:56:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:56:14,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:56:14,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-26 00:56:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:14,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:56:14,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:31,362 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-26 00:56:39,666 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32)))) is different from false [2022-11-26 00:56:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:56:39,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:04,578 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:57:21,086 WARN L233 SmtUtils]: Spent 16.51s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:57:27,337 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:57:37,778 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:57:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:57:37,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1553952230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:37,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230061603] [2022-11-26 00:57:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:37,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:57:37,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:57:37,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:57:37,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:57:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:38,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:57:38,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:54,756 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-11-26 00:58:03,077 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)))))) is different from false [2022-11-26 00:58:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:58:03,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:58:28,240 WARN L233 SmtUtils]: Spent 16.77s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:58:45,044 WARN L233 SmtUtils]: Spent 16.80s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-26 00:58:51,293 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:59:01,741 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-26 00:59:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:59:01,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230061603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:59:01,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:59:01,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2022-11-26 00:59:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886627231] [2022-11-26 00:59:01,745 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:59:01,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 00:59:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:59:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 00:59:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2022-11-26 00:59:01,748 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:59:03,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:59:05,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:59:08,214 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2))) is different from true [2022-11-26 00:59:10,423 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1) .cse1)) is different from true [2022-11-26 00:59:12,630 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-11-26 00:59:14,844 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from false [2022-11-26 00:59:17,025 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|))) (_ bv0 32))) .cse1 .cse2) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse1 .cse2) (not .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1 .cse2) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))))) is different from true [2022-11-26 00:59:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:59:17,029 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-26 00:59:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:59:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 15 [2022-11-26 00:59:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:59:17,030 INFO L225 Difference]: With dead ends: 24 [2022-11-26 00:59:17,030 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 00:59:17,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2022-11-26 00:59:17,032 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:59:17,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 89 Unchecked, 4.3s Time] [2022-11-26 00:59:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 00:59:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-26 00:59:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:59:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-11-26 00:59:17,040 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-11-26 00:59:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:59:17,041 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-11-26 00:59:17,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:59:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-11-26 00:59:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:59:17,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:59:17,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:59:17,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:17,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:17,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:17,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:59:17,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:59:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:59:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-11-26 00:59:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:59:17,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667191987] [2022-11-26 00:59:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:59:17,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:59:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:59:17,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:59:17,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-26 00:59:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:59:18,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:59:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:59:19,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Invalid model [2022-11-26 00:59:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1666379197] [2022-11-26 00:59:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:59:19,284 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:59:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:59:19,285 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:59:19,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-26 00:59:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:59:24,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:59:24,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:59:38,743 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:00:09,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.gt .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-26 01:00:55,530 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1))))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse5 .cse3)))) (_ bv0 32)) (fp.gt .cse5 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1)))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) is different from false [2022-11-26 01:01:27,315 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1))))) (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse4))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse5 .cse3)))) (_ bv0 32)) (fp.gt .cse5 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1))))))) is different from false [2022-11-26 01:01:43,347 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1)))) is different from false [2022-11-26 01:01:45,395 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse1)))) is different from true [2022-11-26 01:01:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 01:01:45,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:51,982 WARN L837 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-11-26 01:01:54,048 WARN L859 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-11-26 01:02:08,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from false [2022-11-26 01:02:10,846 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (_ bv0 32)) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from true [2022-11-26 01:02:38,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from false [2022-11-26 01:02:40,468 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from true [2022-11-26 01:02:51,735 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from false [2022-11-26 01:02:53,802 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) is different from true [2022-11-26 01:03:10,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_15|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ bv0 32)) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_15| .cse1))))) is different from false [2022-11-26 01:03:12,832 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_15| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_15|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ bv0 32)) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_15| .cse1))))) is different from true [2022-11-26 01:03:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 01:03:12,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:03:12,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667191987] [2022-11-26 01:03:12,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:03:12,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1666379197] [2022-11-26 01:03:12,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1666379197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:03:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92590300] [2022-11-26 01:03:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:03:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:03:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:03:12,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:03:12,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b7aed01-42b7-4d38-bc18-6cdbb5c60170/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process