./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:30:39,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:30:39,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:30:39,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:30:39,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:30:39,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:30:39,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:30:40,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:30:40,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:30:40,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:30:40,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:30:40,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:30:40,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:30:40,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:30:40,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:30:40,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:30:40,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:30:40,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:30:40,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:30:40,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:30:40,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:30:40,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:30:40,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:30:40,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:30:40,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:30:40,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:30:40,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:30:40,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:30:40,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:30:40,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:30:40,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:30:40,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:30:40,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:30:40,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:30:40,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:30:40,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:30:40,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:30:40,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:30:40,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:30:40,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:30:40,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:30:40,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:30:40,090 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:30:40,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:30:40,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:30:40,091 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:30:40,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:30:40,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:30:40,101 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:30:40,101 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:30:40,102 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:30:40,102 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:30:40,102 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:30:40,102 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:30:40,103 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:30:40,103 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:30:40,103 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:30:40,103 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:30:40,104 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:30:40,104 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:30:40,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:30:40,105 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:30:40,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:30:40,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:30:40,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:30:40,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:30:40,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:30:40,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:30:40,106 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:30:40,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:30:40,107 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:30:40,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:30:40,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:30:40,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:30:40,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:30:40,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:30:40,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:30:40,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:30:40,109 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:30:40,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:30:40,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:30:40,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:30:40,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:30:40,110 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/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_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-21 01:30:40,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:30:40,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:30:40,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:30:40,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:30:40,527 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:30:40,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-21 01:30:40,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/5b587c17f/f1923e917e634670a82335dcee8b3624/FLAG52cca5d5d [2021-11-21 01:30:41,295 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:30:41,296 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-21 01:30:41,312 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/5b587c17f/f1923e917e634670a82335dcee8b3624/FLAG52cca5d5d [2021-11-21 01:30:41,632 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/5b587c17f/f1923e917e634670a82335dcee8b3624 [2021-11-21 01:30:41,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:30:41,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:30:41,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:30:41,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:30:41,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:30:41,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:30:41" (1/1) ... [2021-11-21 01:30:41,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be18c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:41, skipping insertion in model container [2021-11-21 01:30:41,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:30:41" (1/1) ... [2021-11-21 01:30:41,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:30:41,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:30:41,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-21 01:30:41,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:30:41,961 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:30:41,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-21 01:30:41,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:30:42,000 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:30:42,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42 WrapperNode [2021-11-21 01:30:42,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:30:42,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:30:42,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:30:42,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:30:42,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,043 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-11-21 01:30:42,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:30:42,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:30:42,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:30:42,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:30:42,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:30:42,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:30:42,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:30:42,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:30:42,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (1/1) ... [2021-11-21 01:30:42,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:30:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:30:42,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:30:42,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:30:42,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:30:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:30:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:30:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:30:42,264 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:30:42,265 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:30:42,455 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:30:42,505 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:30:42,505 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:30:42,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:30:42 BoogieIcfgContainer [2021-11-21 01:30:42,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:30:42,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:30:42,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:30:42,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:30:42,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:30:41" (1/3) ... [2021-11-21 01:30:42,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62186386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:30:42, skipping insertion in model container [2021-11-21 01:30:42,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:42" (2/3) ... [2021-11-21 01:30:42,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62186386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:30:42, skipping insertion in model container [2021-11-21 01:30:42,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:30:42" (3/3) ... [2021-11-21 01:30:42,531 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-21 01:30:42,537 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:30:42,537 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:30:42,619 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:30:42,628 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:30:42,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:30:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:30:42,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:42,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:42,675 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2021-11-21 01:30:42,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:30:42,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194572754] [2021-11-21 01:30:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:42,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:30:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:42,940 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:30:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194572754] [2021-11-21 01:30:42,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194572754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:30:42,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:30:42,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:30:42,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213199961] [2021-11-21 01:30:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:30:42,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:30:42,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:30:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:30:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:30:42,993 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:30:43,057 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2021-11-21 01:30:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:30:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-21 01:30:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:30:43,070 INFO L225 Difference]: With dead ends: 32 [2021-11-21 01:30:43,071 INFO L226 Difference]: Without dead ends: 12 [2021-11-21 01:30:43,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:30:43,081 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:30:43,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:30:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-21 01:30:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-21 01:30:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-21 01:30:43,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2021-11-21 01:30:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:30:43,126 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-21 01:30:43,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-21 01:30:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:30:43,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:43,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:43,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:30:43,132 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2021-11-21 01:30:43,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:30:43,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537735985] [2021-11-21 01:30:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:43,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:30:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:43,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:30:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537735985] [2021-11-21 01:30:43,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537735985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:30:43,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:30:43,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:30:43,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569598519] [2021-11-21 01:30:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:30:43,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:30:43,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:30:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:30:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:30:43,242 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:30:43,351 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-11-21 01:30:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:30:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-21 01:30:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:30:43,376 INFO L225 Difference]: With dead ends: 29 [2021-11-21 01:30:43,377 INFO L226 Difference]: Without dead ends: 27 [2021-11-21 01:30:43,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-21 01:30:43,381 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:30:43,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:30:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-21 01:30:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2021-11-21 01:30:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-21 01:30:43,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-11-21 01:30:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:30:43,390 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-21 01:30:43,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-21 01:30:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:30:43,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:43,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:43,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:30:43,393 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2021-11-21 01:30:43,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:30:43,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778531796] [2021-11-21 01:30:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:43,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:30:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:30:43,420 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 01:30:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:30:43,478 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 01:30:43,478 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 01:30:43,480 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:30:43,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:30:43,490 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-21 01:30:43,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:30:43,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:30:43 BoogieIcfgContainer [2021-11-21 01:30:43,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:30:43,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:30:43,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:30:43,553 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:30:43,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:30:42" (3/4) ... [2021-11-21 01:30:43,557 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 01:30:43,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:30:43,559 INFO L158 Benchmark]: Toolchain (without parser) took 1920.86ms. Allocated memory is still 104.9MB. Free memory was 68.8MB in the beginning and 77.4MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:30:43,559 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:30:43,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.86ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 81.3MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:30:43,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.79ms. Allocated memory is still 104.9MB. Free memory was 81.3MB in the beginning and 79.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:30:43,572 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 104.9MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:30:43,575 INFO L158 Benchmark]: RCFGBuilder took 438.90ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 69.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:30:43,575 INFO L158 Benchmark]: TraceAbstraction took 1041.83ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 78.0MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:30:43,576 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 104.9MB. Free memory was 78.0MB in the beginning and 77.4MB in the end (delta: 534.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:30:43,583 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.30ms. Allocated memory is still 104.9MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.86ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 81.3MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.79ms. Allocated memory is still 104.9MB. Free memory was 81.3MB in the beginning and 79.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 104.9MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.90ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 69.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1041.83ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 78.0MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 104.9MB. Free memory was 78.0MB in the beginning and 77.4MB in the end (delta: 534.7kB). 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: 56]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=49, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=49, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L80] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2021-11-21 01:30:43,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:30:46,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:30:46,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:30:46,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:30:46,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:30:46,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:30:46,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:30:46,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:30:46,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:30:46,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:30:46,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:30:46,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:30:46,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:30:46,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:30:46,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:30:46,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:30:46,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:30:46,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:30:46,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:30:46,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:30:46,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:30:46,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:30:46,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:30:46,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:30:46,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:30:46,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:30:46,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:30:46,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:30:46,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:30:46,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:30:46,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:30:46,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:30:46,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:30:46,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:30:46,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:30:46,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:30:46,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:30:46,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:30:46,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:30:46,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:30:46,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:30:46,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 01:30:46,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:30:46,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:30:46,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:30:46,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:30:46,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:30:46,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:30:46,801 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:30:46,801 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:30:46,801 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:30:46,801 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:30:46,803 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:30:46,803 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:30:46,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:30:46,805 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:30:46,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:30:46,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:30:46,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:30:46,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:30:46,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:30:46,806 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:30:46,806 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:30:46,807 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:30:46,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:30:46,807 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:30:46,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:30:46,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:30:46,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:30:46,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:30:46,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:30:46,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:30:46,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:30:46,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:30:46,810 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:30:46,810 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:30:46,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:30:46,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:30:46,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:30:46,812 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_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/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_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2021-11-21 01:30:47,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:30:47,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:30:47,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:30:47,346 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:30:47,346 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:30:47,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-21 01:30:47,431 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/27e8a8763/6864369b9f3d4397ad62af8dbe81488f/FLAGb3bcb88dd [2021-11-21 01:30:48,019 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:30:48,020 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2021-11-21 01:30:48,028 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/27e8a8763/6864369b9f3d4397ad62af8dbe81488f/FLAGb3bcb88dd [2021-11-21 01:30:48,379 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/data/27e8a8763/6864369b9f3d4397ad62af8dbe81488f [2021-11-21 01:30:48,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:30:48,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:30:48,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:30:48,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:30:48,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:30:48,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f41f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48, skipping insertion in model container [2021-11-21 01:30:48,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:30:48,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:30:48,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-21 01:30:48,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:30:48,623 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:30:48,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2021-11-21 01:30:48,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:30:48,718 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:30:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48 WrapperNode [2021-11-21 01:30:48,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:30:48,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:30:48,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:30:48,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:30:48,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,753 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-11-21 01:30:48,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:30:48,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:30:48,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:30:48,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:30:48,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:30:48,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:30:48,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:30:48,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:30:48,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (1/1) ... [2021-11-21 01:30:48,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:30:48,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:30:48,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:30:48,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:30:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:30:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:30:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:30:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:30:48,942 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:30:48,944 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:30:51,148 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:30:51,155 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:30:51,156 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:30:51,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:30:51 BoogieIcfgContainer [2021-11-21 01:30:51,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:30:51,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:30:51,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:30:51,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:30:51,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:30:48" (1/3) ... [2021-11-21 01:30:51,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:30:51, skipping insertion in model container [2021-11-21 01:30:51,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:30:48" (2/3) ... [2021-11-21 01:30:51,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:30:51, skipping insertion in model container [2021-11-21 01:30:51,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:30:51" (3/3) ... [2021-11-21 01:30:51,168 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2021-11-21 01:30:51,174 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:30:51,174 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:30:51,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:30:51,265 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:30:51,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:30:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:30:51,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:51,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:51,289 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2021-11-21 01:30:51,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:30:51,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22241037] [2021-11-21 01:30:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:51,312 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:30:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:30:51,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:30:51,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:30:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:51,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:30:51,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:30:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:51,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:30:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:51,594 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:30:51,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22241037] [2021-11-21 01:30:51,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22241037] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:30:51,596 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:30:51,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-21 01:30:51,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729333133] [2021-11-21 01:30:51,599 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:30:51,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:30:51,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:30:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:30:51,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:30:51,654 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:30:52,020 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2021-11-21 01:30:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:30:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 01:30:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:30:52,036 INFO L225 Difference]: With dead ends: 40 [2021-11-21 01:30:52,036 INFO L226 Difference]: Without dead ends: 15 [2021-11-21 01:30:52,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:30:52,049 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:30:52,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:30:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-21 01:30:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-21 01:30:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2021-11-21 01:30:52,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2021-11-21 01:30:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:30:52,097 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2021-11-21 01:30:52,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-11-21 01:30:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:30:52,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:52,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:52,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:30:52,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:30:52,317 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2021-11-21 01:30:52,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:30:52,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563961048] [2021-11-21 01:30:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:52,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:30:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:30:52,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:30:52,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:30:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:52,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:30:52,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:30:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:52,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:30:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:52,661 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:30:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563961048] [2021-11-21 01:30:52,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563961048] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:30:52,662 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:30:52,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 01:30:52,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477337810] [2021-11-21 01:30:52,662 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:30:52,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:30:52,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:30:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:30:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:30:52,665 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:30:52,866 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2021-11-21 01:30:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:30:52,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 01:30:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:30:52,869 INFO L225 Difference]: With dead ends: 41 [2021-11-21 01:30:52,870 INFO L226 Difference]: Without dead ends: 39 [2021-11-21 01:30:52,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:30:52,872 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:30:52,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 98 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:30:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-21 01:30:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2021-11-21 01:30:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-21 01:30:52,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-21 01:30:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:30:52,891 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-21 01:30:52,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-21 01:30:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:30:52,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:52,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:52,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:30:53,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:30:53,115 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2021-11-21 01:30:53,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:30:53,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540408222] [2021-11-21 01:30:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:53,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:30:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:30:53,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:30:53,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:30:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:53,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:30:53,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:30:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:53,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:30:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:53,403 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:30:53,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540408222] [2021-11-21 01:30:53,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540408222] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:30:53,404 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:30:53,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:30:53,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692864323] [2021-11-21 01:30:53,405 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:30:53,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:30:53,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:30:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:30:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:30:53,407 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:30:54,581 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-11-21 01:30:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:30:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 01:30:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:30:54,586 INFO L225 Difference]: With dead ends: 52 [2021-11-21 01:30:54,586 INFO L226 Difference]: Without dead ends: 37 [2021-11-21 01:30:54,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:30:54,588 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:30:54,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 01:30:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-21 01:30:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2021-11-21 01:30:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-21 01:30:54,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-21 01:30:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:30:54,597 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-21 01:30:54,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:30:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-21 01:30:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:30:54,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:30:54,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:54,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:30:54,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:30:54,814 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:30:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:30:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2021-11-21 01:30:54,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:30:54,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011291520] [2021-11-21 01:30:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:54,816 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:30:54,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:30:54,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:30:54,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:30:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:55,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 01:30:55,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:30:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:30:56,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:31:02,417 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-21 01:31:04,475 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-21 01:31:18,897 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-21 01:31:20,943 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-21 01:31:35,424 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-21 01:31:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:31:47,888 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:31:47,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011291520] [2021-11-21 01:31:47,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011291520] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:31:47,889 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:31:47,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-21 01:31:47,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950831863] [2021-11-21 01:31:47,889 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:31:47,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 01:31:47,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:31:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 01:31:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-21 01:31:47,891 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:31:49,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (= .cse0 |c_ULTIMATE.start_main_~main__E1~0#1|) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:31:52,025 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:31:54,084 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:31:55,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:31:57,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:31:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:31:57,833 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2021-11-21 01:31:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:31:57,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 01:31:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:31:57,834 INFO L225 Difference]: With dead ends: 57 [2021-11-21 01:31:57,834 INFO L226 Difference]: Without dead ends: 39 [2021-11-21 01:31:57,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=8, NotChecked=102, Total=182 [2021-11-21 01:31:57,836 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:31:57,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 1 Unknown, 85 Unchecked, 3.8s Time] [2021-11-21 01:31:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-21 01:31:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-11-21 01:31:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:31:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-21 01:31:57,841 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2021-11-21 01:31:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:31:57,841 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-21 01:31:57,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:31:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-21 01:31:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:31:57,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:31:57,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:31:57,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:31:58,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:31:58,042 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:31:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:31:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2021-11-21 01:31:58,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:31:58,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169231362] [2021-11-21 01:31:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:31:58,044 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:31:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:31:58,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:31:58,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:31:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:31:58,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 01:31:58,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:31:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:31:59,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:32:09,818 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from false [2021-11-21 01:32:11,873 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from true [2021-11-21 01:32:32,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from false [2021-11-21 01:32:34,879 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse0 (fp.neg .cse1))))) is different from true [2021-11-21 01:32:53,620 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2)))))) is different from true [2021-11-21 01:33:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:10,313 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:10,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169231362] [2021-11-21 01:33:10,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169231362] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:10,313 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:10,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2021-11-21 01:33:10,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956642530] [2021-11-21 01:33:10,314 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:10,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:33:10,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:10,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:33:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=39, Unknown=5, NotChecked=48, Total=132 [2021-11-21 01:33:10,316 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:12,396 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq .cse0 .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2)))))) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse3) (= .cse3 |c_ULTIMATE.start_main_~main__E1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:33:14,458 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse2 .cse3) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq .cse2 (fp.neg .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:33:16,522 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (= |c_ULTIMATE.start_main_~main__S~0#1| .cse1) (= .cse1 |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (fp.leq .cse2 .cse3) (not (fp.geq .cse2 (fp.neg .cse3))))))) is different from true [2021-11-21 01:33:18,578 WARN L515 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 [] [2021-11-21 01:33:20,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:33:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:20,855 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2021-11-21 01:33:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:33:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-21 01:33:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:20,858 INFO L225 Difference]: With dead ends: 64 [2021-11-21 01:33:20,858 INFO L226 Difference]: Without dead ends: 46 [2021-11-21 01:33:20,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=46, Invalid=42, Unknown=8, NotChecked=114, Total=210 [2021-11-21 01:33:20,860 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:20,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 2 Unknown, 81 Unchecked, 4.3s Time] [2021-11-21 01:33:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-21 01:33:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2021-11-21 01:33:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-11-21 01:33:20,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2021-11-21 01:33:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:20,877 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-11-21 01:33:20,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-11-21 01:33:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-21 01:33:20,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:20,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:20,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:21,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:21,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:33:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2021-11-21 01:33:21,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:21,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876813277] [2021-11-21 01:33:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:21,097 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:21,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:21,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:21,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:33:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:21,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:33:21,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:59,742 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from false [2021-11-21 01:34:01,751 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from true [2021-11-21 01:34:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-21 01:34:53,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:02,044 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-21 01:35:04,091 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-21 01:35:18,515 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-21 01:35:20,564 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-21 01:35:35,072 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-21 01:36:51,748 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse0))))) is different from true [2021-11-21 01:37:13,426 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) is different from true [2021-11-21 01:37:33,385 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) is different from true [2021-11-21 01:37:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-21 01:37:42,521 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:37:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876813277] [2021-11-21 01:37:42,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876813277] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:37:42,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1464070045] [2021-11-21 01:37:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:37:42,522 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:37:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:37:42,542 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:37:42,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 01:37:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:37:43,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:37:43,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:37:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:37:50,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:39:34,544 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0))))) is different from true [2021-11-21 01:39:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-21 01:39:46,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1464070045] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:39:46,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733603517] [2021-11-21 01:39:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:46,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:39:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:39:46,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:39:46,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-21 01:39:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:39:49,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 01:39:49,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:39:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:39:56,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:40:27,621 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) is different from false [2021-11-21 01:40:29,671 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) is different from true [2021-11-21 01:40:44,162 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0))))) is different from true [2021-11-21 01:41:47,941 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0))))) is different from true [2021-11-21 01:42:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-21 01:42:53,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733603517] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:53,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:42:53,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 8, 9, 10] total 23 [2021-11-21 01:42:53,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353425591] [2021-11-21 01:42:53,446 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:42:53,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-21 01:42:53,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:42:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-21 01:42:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=86, Unknown=21, NotChecked=330, Total=506 [2021-11-21 01:42:53,448 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:42:55,459 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 01:43:15,762 WARN L227 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:43:31,334 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1))))) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse2))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse2))))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg .cse3))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse3))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:43:34,117 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse1))))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:43:36,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) is different from false [2021-11-21 01:43:38,232 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse3))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) is different from true [2021-11-21 01:43:41,743 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2))) (.cse1 (fp.neg .cse2))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse2) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or .cse0 (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-21 01:43:43,848 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-21 01:43:45,964 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0))))) (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse1))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse1))))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse2)))))) is different from true [2021-11-21 01:44:01,536 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_#t~nondet4#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_#t~nondet4#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_#t~nondet4#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_#t~nondet4#1| .cse0))))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))) is different from true [2021-11-21 01:44:03,602 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from false [2021-11-21 01:44:05,682 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-21 01:44:07,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) (or .cse0 (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from false [2021-11-21 01:44:09,810 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) (or .cse0 (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2021-11-21 01:44:11,874 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse0))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from false [2021-11-21 01:44:13,947 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_15| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_15|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_15| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_15| .cse0))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-21 01:44:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:44:13,949 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2021-11-21 01:44:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 01:44:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-21 01:44:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:44:13,950 INFO L225 Difference]: With dead ends: 67 [2021-11-21 01:44:13,950 INFO L226 Difference]: Without dead ends: 49 [2021-11-21 01:44:13,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 148.2s TimeCoverageRelationStatistics Valid=108, Invalid=143, Unknown=47, NotChecked=1034, Total=1332 [2021-11-21 01:44:13,953 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:44:13,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 191 Unchecked, 0.0s Time] [2021-11-21 01:44:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-21 01:44:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2021-11-21 01:44:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:44:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-11-21 01:44:13,975 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2021-11-21 01:44:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:44:13,976 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-11-21 01:44:13,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:44:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-11-21 01:44:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-21 01:44:13,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:44:13,979 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:44:14,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:14,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:14,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:14,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:44:14,592 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:44:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:44:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2021-11-21 01:44:14,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:44:14,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755196884] [2021-11-21 01:44:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:44:14,593 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:44:14,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:44:14,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:44:14,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ab260cd-c791-4377-9cd6-4174738576b4/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-21 01:44:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:44:16,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 01:44:16,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:45:04,437 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false