./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:35:35,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:35:35,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:35:35,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:35:35,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:35:35,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:35:35,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:35:35,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:35:35,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:35:35,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:35:35,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:35:35,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:35:35,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:35:35,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:35:35,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:35:35,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:35:35,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:35:35,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:35:35,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:35:35,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:35:35,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:35:35,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:35:35,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:35:35,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:35:35,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:35:35,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:35:35,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:35:35,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:35:35,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:35:35,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:35:35,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:35:35,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:35:35,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:35:35,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:35:35,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:35:35,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:35:35,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:35:35,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:35:35,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:35:35,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:35:35,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:35:35,141 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:35:35,169 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:35:35,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:35:35,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:35:35,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:35:35,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:35:35,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:35:35,171 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:35:35,171 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:35:35,171 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:35:35,171 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:35:35,172 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:35:35,172 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:35:35,172 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:35:35,172 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:35:35,172 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:35:35,173 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:35:35,173 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:35:35,173 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:35:35,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:35:35,174 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:35:35,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:35:35,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:35:35,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:35:35,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:35:35,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:35:35,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:35:35,175 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:35:35,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:35:35,176 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:35:35,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:35:35,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:35:35,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:35:35,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:35:35,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:35:35,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:35:35,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:35:35,178 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:35:35,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:35:35,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:35:35,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:35:35,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:35:35,179 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-21 01:35:35,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:35:35,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:35:35,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:35:35,488 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:35:35,489 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:35:35,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-21 01:35:35,576 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/327761de5/bd5cca34299a418e825fb25079641077/FLAG13d328ea0 [2021-11-21 01:35:36,065 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:35:36,066 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-21 01:35:36,073 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/327761de5/bd5cca34299a418e825fb25079641077/FLAG13d328ea0 [2021-11-21 01:35:36,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/327761de5/bd5cca34299a418e825fb25079641077 [2021-11-21 01:35:36,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:35:36,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:35:36,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:35:36,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:35:36,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:35:36,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4159a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36, skipping insertion in model container [2021-11-21 01:35:36,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:35:36,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:35:36,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-21 01:35:36,689 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-21 01:35:36,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:35:36,709 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:35:36,724 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-21 01:35:36,729 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-21 01:35:36,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:35:36,746 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:35:36,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36 WrapperNode [2021-11-21 01:35:36,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:35:36,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:35:36,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:35:36,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:35:36,761 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:35:36" (1/1) ... [2021-11-21 01:35:36,773 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:35:36" (1/1) ... [2021-11-21 01:35:36,799 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-11-21 01:35:36,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:35:36,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:35:36,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:35:36,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:35:36,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:35:36,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:35:36,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:35:36,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:35:36,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (1/1) ... [2021-11-21 01:35:36,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:35:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:35:36,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:35:36,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:35:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:35:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:35:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:35:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:35:36,955 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:35:36,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:35:37,103 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:35:37,128 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:35:37,128 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:35:37,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:35:37 BoogieIcfgContainer [2021-11-21 01:35:37,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:35:37,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:35:37,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:35:37,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:35:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:35:36" (1/3) ... [2021-11-21 01:35:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d47c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:35:37, skipping insertion in model container [2021-11-21 01:35:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:36" (2/3) ... [2021-11-21 01:35:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d47c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:35:37, skipping insertion in model container [2021-11-21 01:35:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:35:37" (3/3) ... [2021-11-21 01:35:37,139 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-21 01:35:37,144 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:35:37,144 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-21 01:35:37,193 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:35:37,200 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:35:37,200 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-21 01:35:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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:35:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:35:37,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:37,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:37,222 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:35:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash -576365883, now seen corresponding path program 1 times [2021-11-21 01:35:37,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:35:37,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581729171] [2021-11-21 01:35:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:37,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:35:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:37,482 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:35:37,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:35:37,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581729171] [2021-11-21 01:35:37,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581729171] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:35:37,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:35:37,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:35:37,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825849745] [2021-11-21 01:35:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:35:37,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:35:37,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:35:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:35:37,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:35:37,520 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.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:35:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:35:37,599 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2021-11-21 01:35:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:35:37,601 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:35:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:35:37,609 INFO L225 Difference]: With dead ends: 37 [2021-11-21 01:35:37,609 INFO L226 Difference]: Without dead ends: 29 [2021-11-21 01:35:37,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:35:37,616 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:35:37,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:35:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-21 01:35:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-21 01:35:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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:35:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-11-21 01:35:37,650 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2021-11-21 01:35:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:35:37,651 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-11-21 01:35:37,651 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:35:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-11-21 01:35:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:35:37,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:37,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:37,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:35:37,653 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:35:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash -508829686, now seen corresponding path program 1 times [2021-11-21 01:35:37,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:35:37,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466445603] [2021-11-21 01:35:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:37,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:35:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:35:37,670 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 01:35:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:35:37,703 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 01:35:37,703 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 01:35:37,705 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-21 01:35:37,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-21 01:35:37,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:35:37,712 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-21 01:35:37,715 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:35:37,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:35:37 BoogieIcfgContainer [2021-11-21 01:35:37,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:35:37,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:35:37,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:35:37,742 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:35:37,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:35:37" (3/4) ... [2021-11-21 01:35:37,746 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 01:35:37,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:35:37,747 INFO L158 Benchmark]: Toolchain (without parser) took 1296.16ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 60.6MB in the beginning and 66.6MB in the end (delta: -6.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2021-11-21 01:35:37,748 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:35:37,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.01ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 60.4MB in the beginning and 79.6MB in the end (delta: -19.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:35:37,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.31ms. Allocated memory is still 104.9MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:35:37,750 INFO L158 Benchmark]: Boogie Preprocessor took 31.11ms. Allocated memory is still 104.9MB. Free memory was 78.0MB in the beginning and 76.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:35:37,750 INFO L158 Benchmark]: RCFGBuilder took 298.27ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 65.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:35:37,751 INFO L158 Benchmark]: TraceAbstraction took 609.19ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 67.1MB in the end (delta: -2.1MB). Peak memory consumption was 231.3kB. Max. memory is 16.1GB. [2021-11-21 01:35:37,752 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 104.9MB. Free memory was 67.1MB in the beginning and 66.6MB in the end (delta: 408.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:35:37,763 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.20ms. Allocated memory is still 81.8MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.01ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 60.4MB in the beginning and 79.6MB in the end (delta: -19.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.31ms. Allocated memory is still 104.9MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.11ms. Allocated memory is still 104.9MB. Free memory was 78.0MB in the beginning and 76.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.27ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 65.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 609.19ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 67.1MB in the end (delta: -2.1MB). Peak memory consumption was 231.3kB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 104.9MB. Free memory was 67.1MB in the beginning and 66.6MB in the end (delta: 408.8kB). 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: 58]: 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 45, overapproximation of to_real at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 173. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L173] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__E0=49, main__E1=49, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=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] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=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] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=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] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=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] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 31 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 01:35:37,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:35:40,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:35:40,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:35:40,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:35:40,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:35:40,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:35:40,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:35:40,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:35:40,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:35:40,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:35:40,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:35:40,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:35:40,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:35:40,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:35:40,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:35:40,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:35:40,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:35:40,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:35:40,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:35:40,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:35:40,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:35:40,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:35:40,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:35:40,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:35:40,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:35:40,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:35:40,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:35:40,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:35:40,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:35:40,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:35:40,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:35:40,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:35:40,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:35:40,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:35:40,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:35:40,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:35:40,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:35:40,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:35:40,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:35:40,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:35:40,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:35:40,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 01:35:40,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:35:40,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:35:40,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:35:40,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:35:40,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:35:40,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:35:40,465 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:35:40,465 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:35:40,465 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:35:40,465 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:35:40,467 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:35:40,467 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:35:40,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:35:40,469 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:35:40,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:35:40,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:35:40,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:35:40,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:35:40,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:35:40,470 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:35:40,471 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:35:40,471 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:35:40,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:35:40,472 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:35:40,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:35:40,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:35:40,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:35:40,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:35:40,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:35:40,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:35:40,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:35:40,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:35:40,474 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:35:40,474 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:35:40,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:35:40,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:35:40,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:35:40,475 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-21 01:35:40,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:35:40,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:35:40,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:35:40,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:35:40,909 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:35:40,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-21 01:35:40,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/a05049e50/893787718d4b43378ad7588e433d3e77/FLAGd79b71466 [2021-11-21 01:35:41,523 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:35:41,527 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-21 01:35:41,537 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/a05049e50/893787718d4b43378ad7588e433d3e77/FLAGd79b71466 [2021-11-21 01:35:41,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/data/a05049e50/893787718d4b43378ad7588e433d3e77 [2021-11-21 01:35:41,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:35:41,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:35:41,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:35:41,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:35:41,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:35:41,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:35:41" (1/1) ... [2021-11-21 01:35:41,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629b9a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:41, skipping insertion in model container [2021-11-21 01:35:41,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:35:41" (1/1) ... [2021-11-21 01:35:41,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:35:41,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:35:42,081 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-21 01:35:42,090 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-21 01:35:42,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:35:42,124 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:35:42,148 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-21 01:35:42,154 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_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-21 01:35:42,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:35:42,179 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:35:42,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42 WrapperNode [2021-11-21 01:35:42,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:35:42,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:35:42,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:35:42,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:35:42,190 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:35:42" (1/1) ... [2021-11-21 01:35:42,215 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:35:42" (1/1) ... [2021-11-21 01:35:42,247 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-11-21 01:35:42,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:35:42,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:35:42,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:35:42,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:35:42,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:35:42,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:35:42,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:35:42,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:35:42,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (1/1) ... [2021-11-21 01:35:42,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:35:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:35:42,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:35:42,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:35:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:35:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:35:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:35:42,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:35:42,488 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:35:42,490 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:35:45,615 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:35:45,622 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:35:45,622 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:35:45,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:35:45 BoogieIcfgContainer [2021-11-21 01:35:45,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:35:45,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:35:45,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:35:45,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:35:45,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:35:41" (1/3) ... [2021-11-21 01:35:45,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f75e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:35:45, skipping insertion in model container [2021-11-21 01:35:45,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:35:42" (2/3) ... [2021-11-21 01:35:45,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f75e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:35:45, skipping insertion in model container [2021-11-21 01:35:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:35:45" (3/3) ... [2021-11-21 01:35:45,636 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-21 01:35:45,643 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:35:45,643 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-21 01:35:45,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:35:45,739 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:35:45,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-21 01:35:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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:35:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:35:45,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:45,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:45,759 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:35:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-21 01:35:45,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:35:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362452826] [2021-11-21 01:35:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:45,778 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:35:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:35:45,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:35:45,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:35:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:45,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:35:45,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:35:46,054 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:35:46,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:46,183 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:35:46,184 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:35:46,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362452826] [2021-11-21 01:35:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362452826] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:35:46,185 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:35:46,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 01:35:46,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656319475] [2021-11-21 01:35:46,189 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:35:46,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:35:46,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:35:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:35:46,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:35:46,230 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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 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:35:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:35:46,351 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2021-11-21 01:35:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:35:46,354 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:35:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:35:46,363 INFO L225 Difference]: With dead ends: 62 [2021-11-21 01:35:46,364 INFO L226 Difference]: Without dead ends: 48 [2021-11-21 01:35:46,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:35:46,377 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:35:46,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:35:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-21 01:35:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2021-11-21 01:35:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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:35:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-21 01:35:46,427 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2021-11-21 01:35:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:35:46,428 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-21 01:35:46,428 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:35:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-21 01:35:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:35:46,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:46,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:46,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:35:46,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:35:46,646 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:35:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2021-11-21 01:35:46,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:35:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177257970] [2021-11-21 01:35:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:46,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:35:46,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:35:46,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:35:46,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:35:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:46,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:35:46,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:35:46,808 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:35:46,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:46,885 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:35:46,885 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:35:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177257970] [2021-11-21 01:35:46,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177257970] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:35:46,886 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:35:46,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:35:46,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437361185] [2021-11-21 01:35:46,887 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:35:46,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:35:46,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:35:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:35:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:35:46,889 INFO L87 Difference]: Start difference. First operand 32 states and 40 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:35:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:35:49,070 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-11-21 01:35:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:35:49,077 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:35:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:35:49,079 INFO L225 Difference]: With dead ends: 88 [2021-11-21 01:35:49,079 INFO L226 Difference]: Without dead ends: 68 [2021-11-21 01:35:49,080 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:35:49,081 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:35:49,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-21 01:35:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-21 01:35:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2021-11-21 01:35:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 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:35:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-21 01:35:49,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2021-11-21 01:35:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:35:49,092 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-21 01:35:49,093 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:35:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-21 01:35:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:35:49,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:49,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:49,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:35:49,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:35:49,295 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:35:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2021-11-21 01:35:49,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:35:49,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827664669] [2021-11-21 01:35:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:49,296 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:35:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:35:49,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:35:49,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:35:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:49,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 01:35:49,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:35:50,457 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:35:50,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:56,656 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:58,698 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:36:13,113 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:36:15,155 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:36:29,587 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:42,012 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:36:42,013 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:36:42,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827664669] [2021-11-21 01:36:42,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827664669] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:36:42,013 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:36:42,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-21 01:36:42,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503830755] [2021-11-21 01:36:42,014 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:36:42,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 01:36:42,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:36:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 01:36:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-21 01:36:42,016 INFO L87 Difference]: Start difference. First operand 38 states and 46 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:36:44,093 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:36:46,151 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:36:48,206 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:36:50,477 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:36:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:36:50,614 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2021-11-21 01:36:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:36:50,615 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:36:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:36:50,615 INFO L225 Difference]: With dead ends: 73 [2021-11-21 01:36:50,615 INFO L226 Difference]: Without dead ends: 50 [2021-11-21 01:36:50,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=8, NotChecked=102, Total=182 [2021-11-21 01:36:50,617 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:36:50,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 1 Unknown, 113 Unchecked, 2.4s Time] [2021-11-21 01:36:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-21 01:36:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2021-11-21 01:36:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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:36:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-11-21 01:36:50,623 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2021-11-21 01:36:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:36:50,623 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-21 01:36:50,623 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:36:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2021-11-21 01:36:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:36:50,624 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:36:50,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:36:50,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:36:50,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:36:50,825 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:36:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:36:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1134941057, now seen corresponding path program 1 times [2021-11-21 01:36:50,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:36:50,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744937203] [2021-11-21 01:36:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:36:50,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:36:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:36:50,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:36:50,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:36:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:36:51,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 01:36:51,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:36:51,950 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:36:51,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:37:02,441 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:37:04,485 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:37:24,606 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:37:26,653 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:37:45,288 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:38:01,932 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:38:01,932 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:38:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744937203] [2021-11-21 01:38:01,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744937203] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:38:01,932 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:38:01,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2021-11-21 01:38:01,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899840390] [2021-11-21 01:38:01,933 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:38:01,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:38:01,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:38:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:38:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=39, Unknown=5, NotChecked=48, Total=132 [2021-11-21 01:38:01,934 INFO L87 Difference]: Start difference. First operand 38 states and 45 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:38:04,013 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:38:06,070 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:38:08,123 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:38:10,310 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:38:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:38:10,516 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2021-11-21 01:38:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:38:10,517 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:38:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:38:10,518 INFO L225 Difference]: With dead ends: 79 [2021-11-21 01:38:10,518 INFO L226 Difference]: Without dead ends: 56 [2021-11-21 01:38:10,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=46, Invalid=42, Unknown=8, NotChecked=114, Total=210 [2021-11-21 01:38:10,520 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:38:10,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 76 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 1 Unknown, 157 Unchecked, 2.4s Time] [2021-11-21 01:38:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-21 01:38:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2021-11-21 01:38:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:38:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-11-21 01:38:10,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2021-11-21 01:38:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:38:10,528 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-21 01:38:10,529 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:38:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-11-21 01:38:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 01:38:10,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:38:10,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:38:10,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:38:10,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:38:10,730 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:38:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:38:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2021-11-21 01:38:10,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:38:10,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900207486] [2021-11-21 01:38:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:38:10,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:38:10,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:38:10,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:38:10,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:38:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:38:10,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:38:10,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:38:10,859 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:38:10,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:38:10,911 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:38:10,912 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:38:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900207486] [2021-11-21 01:38:10,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900207486] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:38:10,912 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:38:10,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-21 01:38:10,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779619542] [2021-11-21 01:38:10,913 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:38:10,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:38:10,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:38:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:38:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:38:10,914 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:38:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:38:10,961 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2021-11-21 01:38:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:38:10,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2021-11-21 01:38:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:38:10,963 INFO L225 Difference]: With dead ends: 49 [2021-11-21 01:38:10,963 INFO L226 Difference]: Without dead ends: 29 [2021-11-21 01:38:10,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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:38:10,964 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:38:10,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:38:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-21 01:38:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-21 01:38:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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:38:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-21 01:38:10,970 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2021-11-21 01:38:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:38:10,971 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-21 01:38:10,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:38:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-21 01:38:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 01:38:10,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:38:10,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:38:10,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:38:11,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:38:11,181 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:38:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:38:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2021-11-21 01:38:11,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:38:11,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531522704] [2021-11-21 01:38:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:38:11,182 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:38:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:38:11,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:38:11,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:38:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:38:11,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:38:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:38:11,324 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:38:11,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:38:11,432 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:38:11,432 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:38:11,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531522704] [2021-11-21 01:38:11,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531522704] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:38:11,433 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:38:11,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 01:38:11,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997894658] [2021-11-21 01:38:11,433 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:38:11,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:38:11,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:38:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:38:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:38:11,435 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:38:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:38:11,572 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-11-21 01:38:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:38:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-21 01:38:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:38:11,573 INFO L225 Difference]: With dead ends: 63 [2021-11-21 01:38:11,573 INFO L226 Difference]: Without dead ends: 61 [2021-11-21 01:38:11,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 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:38:11,575 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 45 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:38:11,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:38:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-21 01:38:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2021-11-21 01:38:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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:38:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-11-21 01:38:11,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2021-11-21 01:38:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:38:11,584 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-11-21 01:38:11,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:38:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-11-21 01:38:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 01:38:11,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:38:11,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:38:11,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:38:11,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:38:11,789 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:38:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:38:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2021-11-21 01:38:11,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:38:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613817115] [2021-11-21 01:38:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:38:11,790 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:38:11,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:38:11,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:38:11,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-21 01:38:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:38:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:38:12,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:38:30,521 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:38:30,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:38:38,714 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:38:40,760 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:38:55,132 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:38:57,179 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:39:11,641 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:40:40,687 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ 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_22|) |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_22| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_22| .cse0))))) is different from true [2021-11-21 01:40:57,175 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_22| (_ 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_22|) |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_22| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0))))))) is different from true [2021-11-21 01:41:03,816 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:41:03,816 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:41:03,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613817115] [2021-11-21 01:41:03,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613817115] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:41:03,817 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:41:03,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2021-11-21 01:41:03,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140356465] [2021-11-21 01:41:03,818 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:41:03,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 01:41:03,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:41:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 01:41:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=82, Unknown=11, NotChecked=120, Total=272 [2021-11-21 01:41:03,819 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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:41:16,950 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:41:19,412 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)) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_22| (_ 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_22|) |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_22| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_22| .cse1))))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:41:21,515 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:41:23,920 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_~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| (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 01:41:26,173 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))) (or (not (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:41:28,259 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:41:41,474 WARN L227 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 28 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:41:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:41:41,523 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-11-21 01:41:41,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 01:41:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 24 [2021-11-21 01:41:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:41:41,525 INFO L225 Difference]: With dead ends: 65 [2021-11-21 01:41:41,525 INFO L226 Difference]: Without dead ends: 46 [2021-11-21 01:41:41,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=83, Invalid=116, Unknown=19, NotChecked=288, Total=506 [2021-11-21 01:41:41,527 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:41:41,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 1 Unknown, 177 Unchecked, 2.2s Time] [2021-11-21 01:41:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-21 01:41:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2021-11-21 01:41:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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:41:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2021-11-21 01:41:41,536 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 24 [2021-11-21 01:41:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:41:41,536 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-11-21 01:41:41,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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:41:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-11-21 01:41:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 01:41:41,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:41:41,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:41:41,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:41:41,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:41:41,751 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:41:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:41:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2021-11-21 01:41:41,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:41:41,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161811972] [2021-11-21 01:41:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:41:41,753 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:41:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:41:41,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:41:41,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb9474b-d031-42bd-b0e4-dd91c1fb9f42/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 01:41:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:41:43,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 01:41:43,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:24,905 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 [2021-11-21 01:43:52,262 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 ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 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) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .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.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2021-11-21 01:43:54,290 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 ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 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) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .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.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2021-11-21 01:46:14,925 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:46:14,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:46:21,159 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:46:23,213 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:46:37,660 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:46:39,711 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:46:54,225 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:47:58,695 WARN L860 $PredicateComparison]: unable to prove that (or (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)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) is different from true [2021-11-21 01:48:13,250 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (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)))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse1))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2021-11-21 01:48:28,014 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg .cse0))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_24| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_24| (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|) |v_ULTIMATE.start_main_~main__E0~0#1_24|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))))) is different from true [2021-11-21 01:48:51,205 WARN L838 $PredicateComparison]: unable to prove that (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 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_24|) |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_24| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_24| (fp.neg .cse1)))))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)))) is different from false [2021-11-21 01:48:53,290 WARN L860 $PredicateComparison]: unable to prove that (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 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_24|) |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_24| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_24| (fp.neg .cse1)))))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)))) is different from true [2021-11-21 01:49:41,549 WARN L838 $PredicateComparison]: unable to prove that (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 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_24|) |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_24| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_24| (fp.neg .cse1)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)))) is different from false [2021-11-21 01:49:43,644 WARN L860 $PredicateComparison]: unable to prove that (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 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_24| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|))) |v_ULTIMATE.start_main_~main__E0~0#1_24|) |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_24| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_24| (fp.neg .cse1)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)))) is different from true