./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE --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 4db1032dfd29fb54619de039c3f4db8a50fc2148f96c9b60d6f0bd84d60ae635 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 10:01:55,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:01:55,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:01:55,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:01:55,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:01:55,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:01:55,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:01:55,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:01:55,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:01:55,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:01:55,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:01:55,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:01:55,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:01:55,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:01:55,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:01:55,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:01:55,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:01:55,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:01:55,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:01:55,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:01:55,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:01:55,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:01:55,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:01:55,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:01:55,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:01:55,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:01:55,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:01:55,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:01:55,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:01:55,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:01:55,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:01:55,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:01:55,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:01:55,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:01:55,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:01:55,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:01:55,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:01:55,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:01:55,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:01:55,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:01:55,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:01:55,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 10:01:55,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:01:55,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:01:55,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:01:55,917 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:01:55,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:01:55,917 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:01:55,917 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:01:55,917 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:01:55,918 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:01:55,918 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:01:55,918 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:01:55,918 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:01:55,918 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:01:55,919 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:01:55,919 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:01:55,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:01:55,920 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:01:55,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:01:55,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:01:55,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:01:55,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 10:01:55,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:01:55,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 10:01:55,921 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:01:55,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:01:55,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 10:01:55,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:01:55,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 10:01:55,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:01:55,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:01:55,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:01:55,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:01:55,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:01:55,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 10:01:55,924 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:01:55,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:01:55,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 10:01:55,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:01:55,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:01:55,924 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_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/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_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE 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 -> 4db1032dfd29fb54619de039c3f4db8a50fc2148f96c9b60d6f0bd84d60ae635 [2021-10-24 10:01:56,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:01:56,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:01:56,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:01:56,184 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:01:56,185 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:01:56,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-24 10:01:56,262 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/data/9a5119895/2c19268006a6465a8cd053d6155a88e5/FLAG31c535552 [2021-10-24 10:01:56,716 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:01:56,716 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-24 10:01:56,736 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/data/9a5119895/2c19268006a6465a8cd053d6155a88e5/FLAG31c535552 [2021-10-24 10:01:57,115 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/data/9a5119895/2c19268006a6465a8cd053d6155a88e5 [2021-10-24 10:01:57,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:01:57,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:01:57,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:01:57,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:01:57,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:01:57,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2fd29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57, skipping insertion in model container [2021-10-24 10:01:57,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:01:57,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:01:57,314 WARN L228 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_8ef16539-147f-482f-8430-fe6562723832/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-24 10:01:57,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:01:57,385 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:01:57,396 WARN L228 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_8ef16539-147f-482f-8430-fe6562723832/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-24 10:01:57,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:01:57,463 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:01:57,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57 WrapperNode [2021-10-24 10:01:57,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:01:57,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:01:57,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:01:57,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:01:57,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:01:57,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:01:57,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:01:57,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:01:57,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:01:57,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:01:57,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:01:57,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:01:57,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (1/1) ... [2021-10-24 10:01:57,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:01:57,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:01:57,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:01:57,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:01:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:01:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 10:01:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:01:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:01:59,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:01:59,632 INFO L299 CfgBuilder]: Removed 130 assume(true) statements. [2021-10-24 10:01:59,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:01:59 BoogieIcfgContainer [2021-10-24 10:01:59,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:01:59,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:01:59,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:01:59,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:01:59,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:01:57" (1/3) ... [2021-10-24 10:01:59,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648d6780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:01:59, skipping insertion in model container [2021-10-24 10:01:59,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:01:57" (2/3) ... [2021-10-24 10:01:59,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648d6780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:01:59, skipping insertion in model container [2021-10-24 10:01:59,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:01:59" (3/3) ... [2021-10-24 10:01:59,646 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2021-10-24 10:01:59,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:01:59,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-24 10:01:59,715 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:01:59,724 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-10-24 10:01:59,724 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-24 10:01:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 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-10-24 10:01:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:01:59,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:01:59,748 INFO L512 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] [2021-10-24 10:01:59,749 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:01:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:01:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1914888244, now seen corresponding path program 1 times [2021-10-24 10:01:59,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:01:59,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016338246] [2021-10-24 10:01:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:01:59,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:01:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:01:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:01:59,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:01:59,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016338246] [2021-10-24 10:01:59,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016338246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:01:59,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:01:59,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:01:59,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524743892] [2021-10-24 10:01:59,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:01:59,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:01:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:01:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:01:59,950 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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-10-24 10:02:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:00,037 INFO L93 Difference]: Finished difference Result 405 states and 621 transitions. [2021-10-24 10:02:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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 22 [2021-10-24 10:02:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:00,051 INFO L225 Difference]: With dead ends: 405 [2021-10-24 10:02:00,051 INFO L226 Difference]: Without dead ends: 258 [2021-10-24 10:02:00,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-24 10:02:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2021-10-24 10:02:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 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-10-24 10:02:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2021-10-24 10:02:00,107 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 22 [2021-10-24 10:02:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:00,107 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2021-10-24 10:02:00,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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-10-24 10:02:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2021-10-24 10:02:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:02:00,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:00,111 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:00,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:02:00,111 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365306, now seen corresponding path program 1 times [2021-10-24 10:02:00,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:00,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361306649] [2021-10-24 10:02:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:00,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:02:00,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:00,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361306649] [2021-10-24 10:02:00,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361306649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:00,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:00,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:00,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897441443] [2021-10-24 10:02:00,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:00,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:00,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:00,233 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 10:02:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:00,389 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2021-10-24 10:02:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:00,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2021-10-24 10:02:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:00,394 INFO L225 Difference]: With dead ends: 774 [2021-10-24 10:02:00,394 INFO L226 Difference]: Without dead ends: 539 [2021-10-24 10:02:00,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-10-24 10:02:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2021-10-24 10:02:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.460093896713615) internal successors, (622), 426 states have internal predecessors, (622), 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-10-24 10:02:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 622 transitions. [2021-10-24 10:02:00,425 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 622 transitions. Word has length 43 [2021-10-24 10:02:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:00,425 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 622 transitions. [2021-10-24 10:02:00,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 10:02:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 622 transitions. [2021-10-24 10:02:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:02:00,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:00,429 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:00,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:02:00,430 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash -302451303, now seen corresponding path program 1 times [2021-10-24 10:02:00,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:00,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007608014] [2021-10-24 10:02:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:00,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:02:00,488 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:00,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007608014] [2021-10-24 10:02:00,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007608014] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:00,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:00,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:00,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778137706] [2021-10-24 10:02:00,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:00,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:00,490 INFO L87 Difference]: Start difference. First operand 427 states and 622 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 10:02:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:00,608 INFO L93 Difference]: Finished difference Result 1358 states and 1963 transitions. [2021-10-24 10:02:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2021-10-24 10:02:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:00,614 INFO L225 Difference]: With dead ends: 1358 [2021-10-24 10:02:00,614 INFO L226 Difference]: Without dead ends: 943 [2021-10-24 10:02:00,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-10-24 10:02:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 756. [2021-10-24 10:02:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.4317880794701987) internal successors, (1081), 755 states have internal predecessors, (1081), 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-10-24 10:02:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1081 transitions. [2021-10-24 10:02:00,652 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1081 transitions. Word has length 43 [2021-10-24 10:02:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:00,652 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1081 transitions. [2021-10-24 10:02:00,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 10:02:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1081 transitions. [2021-10-24 10:02:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:02:00,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:00,657 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:00,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 10:02:00,657 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1411597113, now seen corresponding path program 1 times [2021-10-24 10:02:00,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:00,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226548668] [2021-10-24 10:02:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:00,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:00,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:00,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226548668] [2021-10-24 10:02:00,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226548668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:00,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:00,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:00,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239490284] [2021-10-24 10:02:00,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:00,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:00,735 INFO L87 Difference]: Start difference. First operand 756 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-24 10:02:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:00,910 INFO L93 Difference]: Finished difference Result 2486 states and 3517 transitions. [2021-10-24 10:02:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-10-24 10:02:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:00,922 INFO L225 Difference]: With dead ends: 2486 [2021-10-24 10:02:00,922 INFO L226 Difference]: Without dead ends: 1735 [2021-10-24 10:02:00,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-24 10:02:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1343. [2021-10-24 10:02:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.405365126676602) internal successors, (1886), 1342 states have internal predecessors, (1886), 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-10-24 10:02:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1886 transitions. [2021-10-24 10:02:00,987 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1886 transitions. Word has length 43 [2021-10-24 10:02:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:00,988 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1886 transitions. [2021-10-24 10:02:00,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-24 10:02:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1886 transitions. [2021-10-24 10:02:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:02:00,992 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:00,992 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:00,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 10:02:00,992 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2072930904, now seen corresponding path program 1 times [2021-10-24 10:02:00,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:00,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497251102] [2021-10-24 10:02:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:00,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:01,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:01,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497251102] [2021-10-24 10:02:01,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497251102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:01,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:01,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:01,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071420404] [2021-10-24 10:02:01,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:01,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:01,157 INFO L87 Difference]: Start difference. First operand 1343 states and 1886 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-24 10:02:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:01,383 INFO L93 Difference]: Finished difference Result 4577 states and 6469 transitions. [2021-10-24 10:02:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-10-24 10:02:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:01,403 INFO L225 Difference]: With dead ends: 4577 [2021-10-24 10:02:01,403 INFO L226 Difference]: Without dead ends: 3247 [2021-10-24 10:02:01,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-10-24 10:02:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2499. [2021-10-24 10:02:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2498 states have (on average 1.3971176941553243) internal successors, (3490), 2498 states have internal predecessors, (3490), 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-10-24 10:02:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3490 transitions. [2021-10-24 10:02:01,559 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3490 transitions. Word has length 43 [2021-10-24 10:02:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:01,561 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 3490 transitions. [2021-10-24 10:02:01,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-24 10:02:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3490 transitions. [2021-10-24 10:02:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-24 10:02:01,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:01,565 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:01,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 10:02:01,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1241637347, now seen corresponding path program 1 times [2021-10-24 10:02:01,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:01,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243185127] [2021-10-24 10:02:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:01,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:01,655 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:01,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243185127] [2021-10-24 10:02:01,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243185127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:01,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:01,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:01,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808810294] [2021-10-24 10:02:01,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:01,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:01,665 INFO L87 Difference]: Start difference. First operand 2499 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-24 10:02:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:01,841 INFO L93 Difference]: Finished difference Result 4321 states and 6167 transitions. [2021-10-24 10:02:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 44 [2021-10-24 10:02:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:01,857 INFO L225 Difference]: With dead ends: 4321 [2021-10-24 10:02:01,857 INFO L226 Difference]: Without dead ends: 2895 [2021-10-24 10:02:01,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2021-10-24 10:02:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2735. [2021-10-24 10:02:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.4198975859546452) internal successors, (3882), 2734 states have internal predecessors, (3882), 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-10-24 10:02:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3882 transitions. [2021-10-24 10:02:01,991 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3882 transitions. Word has length 44 [2021-10-24 10:02:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:01,992 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3882 transitions. [2021-10-24 10:02:01,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-24 10:02:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3882 transitions. [2021-10-24 10:02:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-24 10:02:01,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:01,998 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:01,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 10:02:01,998 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -585502559, now seen corresponding path program 1 times [2021-10-24 10:02:01,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:01,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145327714] [2021-10-24 10:02:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:02,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:02,053 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:02,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145327714] [2021-10-24 10:02:02,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145327714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:02,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:02,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:02,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638433039] [2021-10-24 10:02:02,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:02,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:02,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:02,055 INFO L87 Difference]: Start difference. First operand 2735 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:02:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:02,210 INFO L93 Difference]: Finished difference Result 4597 states and 6559 transitions. [2021-10-24 10:02:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-24 10:02:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:02,226 INFO L225 Difference]: With dead ends: 4597 [2021-10-24 10:02:02,227 INFO L226 Difference]: Without dead ends: 2935 [2021-10-24 10:02:02,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2021-10-24 10:02:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2735. [2021-10-24 10:02:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.3833211411850768) internal successors, (3782), 2734 states have internal predecessors, (3782), 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-10-24 10:02:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3782 transitions. [2021-10-24 10:02:02,364 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3782 transitions. Word has length 63 [2021-10-24 10:02:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:02,364 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3782 transitions. [2021-10-24 10:02:02,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:02:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3782 transitions. [2021-10-24 10:02:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-24 10:02:02,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:02,370 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:02,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 10:02:02,371 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1004892418, now seen corresponding path program 1 times [2021-10-24 10:02:02,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:02,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051236544] [2021-10-24 10:02:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:02,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:02:02,442 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:02,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051236544] [2021-10-24 10:02:02,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051236544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:02,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:02,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:02,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238473610] [2021-10-24 10:02:02,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:02,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:02,445 INFO L87 Difference]: Start difference. First operand 2735 states and 3782 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-24 10:02:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:02,808 INFO L93 Difference]: Finished difference Result 9605 states and 13297 transitions. [2021-10-24 10:02:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 63 [2021-10-24 10:02:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:02,846 INFO L225 Difference]: With dead ends: 9605 [2021-10-24 10:02:02,846 INFO L226 Difference]: Without dead ends: 6883 [2021-10-24 10:02:02,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2021-10-24 10:02:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5055. [2021-10-24 10:02:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.367233874159082) internal successors, (6910), 5054 states have internal predecessors, (6910), 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-10-24 10:02:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6910 transitions. [2021-10-24 10:02:03,171 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6910 transitions. Word has length 63 [2021-10-24 10:02:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:03,171 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6910 transitions. [2021-10-24 10:02:03,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-24 10:02:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6910 transitions. [2021-10-24 10:02:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-24 10:02:03,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:03,181 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:03,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 10:02:03,181 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1174872423, now seen corresponding path program 1 times [2021-10-24 10:02:03,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:03,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952309829] [2021-10-24 10:02:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:03,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:02:03,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:03,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952309829] [2021-10-24 10:02:03,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952309829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:03,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:03,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:03,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86135635] [2021-10-24 10:02:03,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:03,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:03,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:03,288 INFO L87 Difference]: Start difference. First operand 5055 states and 6910 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:02:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:03,892 INFO L93 Difference]: Finished difference Result 17409 states and 23781 transitions. [2021-10-24 10:02:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:03,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-24 10:02:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:03,950 INFO L225 Difference]: With dead ends: 17409 [2021-10-24 10:02:03,950 INFO L226 Difference]: Without dead ends: 12367 [2021-10-24 10:02:03,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12367 states. [2021-10-24 10:02:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12367 to 9295. [2021-10-24 10:02:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9295 states, 9294 states have (on average 1.347751237357435) internal successors, (12526), 9294 states have internal predecessors, (12526), 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-10-24 10:02:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 12526 transitions. [2021-10-24 10:02:04,531 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 12526 transitions. Word has length 64 [2021-10-24 10:02:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:04,531 INFO L470 AbstractCegarLoop]: Abstraction has 9295 states and 12526 transitions. [2021-10-24 10:02:04,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:02:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 12526 transitions. [2021-10-24 10:02:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-24 10:02:04,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:04,568 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:04,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:02:04,569 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1845858571, now seen corresponding path program 1 times [2021-10-24 10:02:04,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:04,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813810105] [2021-10-24 10:02:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:04,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 10:02:04,674 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:04,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813810105] [2021-10-24 10:02:04,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813810105] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:04,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730302593] [2021-10-24 10:02:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:04,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:04,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:04,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:04,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 10:02:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:04,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-24 10:02:04,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:05,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:05,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730302593] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:05,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:05,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [4] total 10 [2021-10-24 10:02:05,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585769938] [2021-10-24 10:02:05,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:02:05,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:02:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:02:05,311 INFO L87 Difference]: Start difference. First operand 9295 states and 12526 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-10-24 10:02:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:06,654 INFO L93 Difference]: Finished difference Result 25737 states and 35448 transitions. [2021-10-24 10:02:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-24 10:02:06,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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 65 [2021-10-24 10:02:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:06,699 INFO L225 Difference]: With dead ends: 25737 [2021-10-24 10:02:06,699 INFO L226 Difference]: Without dead ends: 16455 [2021-10-24 10:02:06,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2021-10-24 10:02:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2021-10-24 10:02:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 10124. [2021-10-24 10:02:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3684678455003458) internal successors, (13853), 10123 states have internal predecessors, (13853), 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-10-24 10:02:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13853 transitions. [2021-10-24 10:02:07,405 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13853 transitions. Word has length 65 [2021-10-24 10:02:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:07,405 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13853 transitions. [2021-10-24 10:02:07,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-10-24 10:02:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13853 transitions. [2021-10-24 10:02:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-24 10:02:07,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:07,423 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:07,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-24 10:02:07,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:07,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1769743795, now seen corresponding path program 1 times [2021-10-24 10:02:07,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:07,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987078107] [2021-10-24 10:02:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:07,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:07,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:07,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987078107] [2021-10-24 10:02:07,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987078107] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:07,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:07,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:07,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916222100] [2021-10-24 10:02:07,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:07,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:07,712 INFO L87 Difference]: Start difference. First operand 10124 states and 13853 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 10:02:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:08,398 INFO L93 Difference]: Finished difference Result 20234 states and 27692 transitions. [2021-10-24 10:02:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:08,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2021-10-24 10:02:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:08,423 INFO L225 Difference]: With dead ends: 20234 [2021-10-24 10:02:08,424 INFO L226 Difference]: Without dead ends: 10124 [2021-10-24 10:02:08,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2021-10-24 10:02:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10124. [2021-10-24 10:02:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3512792650400078) internal successors, (13679), 10123 states have internal predecessors, (13679), 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-10-24 10:02:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13679 transitions. [2021-10-24 10:02:09,129 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13679 transitions. Word has length 67 [2021-10-24 10:02:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:09,130 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13679 transitions. [2021-10-24 10:02:09,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 10:02:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13679 transitions. [2021-10-24 10:02:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-24 10:02:09,147 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:09,148 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:09,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 10:02:09,148 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1551734542, now seen corresponding path program 1 times [2021-10-24 10:02:09,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:09,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421197198] [2021-10-24 10:02:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:09,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:09,187 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:09,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421197198] [2021-10-24 10:02:09,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421197198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:09,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:09,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:09,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160102572] [2021-10-24 10:02:09,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:09,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:09,189 INFO L87 Difference]: Start difference. First operand 10124 states and 13679 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 10:02:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:09,495 INFO L93 Difference]: Finished difference Result 16851 states and 22836 transitions. [2021-10-24 10:02:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2021-10-24 10:02:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:09,511 INFO L225 Difference]: With dead ends: 16851 [2021-10-24 10:02:09,511 INFO L226 Difference]: Without dead ends: 6741 [2021-10-24 10:02:09,524 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2021-10-24 10:02:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 6670. [2021-10-24 10:02:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6669 states have (on average 1.314589893537262) internal successors, (8767), 6669 states have internal predecessors, (8767), 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-10-24 10:02:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 8767 transitions. [2021-10-24 10:02:09,948 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 8767 transitions. Word has length 67 [2021-10-24 10:02:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:09,949 INFO L470 AbstractCegarLoop]: Abstraction has 6670 states and 8767 transitions. [2021-10-24 10:02:09,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 10:02:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 8767 transitions. [2021-10-24 10:02:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-24 10:02:09,959 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:09,959 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:09,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 10:02:09,959 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1699998803, now seen corresponding path program 1 times [2021-10-24 10:02:09,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:09,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579298387] [2021-10-24 10:02:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:09,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:10,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:10,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579298387] [2021-10-24 10:02:10,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579298387] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:10,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325662207] [2021-10-24 10:02:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:10,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:10,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:10,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 10:02:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:10,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 10:02:10,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:10,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:10,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325662207] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:10,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:10,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [4] total 12 [2021-10-24 10:02:10,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360773131] [2021-10-24 10:02:10,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-24 10:02:10,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-24 10:02:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-24 10:02:10,716 INFO L87 Difference]: Start difference. First operand 6670 states and 8767 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-10-24 10:02:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:11,740 INFO L93 Difference]: Finished difference Result 15807 states and 21033 transitions. [2021-10-24 10:02:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-24 10:02:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 68 [2021-10-24 10:02:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:11,764 INFO L225 Difference]: With dead ends: 15807 [2021-10-24 10:02:11,765 INFO L226 Difference]: Without dead ends: 10406 [2021-10-24 10:02:11,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 286.0ms TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2021-10-24 10:02:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10406 states. [2021-10-24 10:02:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10406 to 6053. [2021-10-24 10:02:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 6052 states have (on average 1.3319563780568406) internal successors, (8061), 6052 states have internal predecessors, (8061), 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-10-24 10:02:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 8061 transitions. [2021-10-24 10:02:12,216 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 8061 transitions. Word has length 68 [2021-10-24 10:02:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:12,216 INFO L470 AbstractCegarLoop]: Abstraction has 6053 states and 8061 transitions. [2021-10-24 10:02:12,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-10-24 10:02:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 8061 transitions. [2021-10-24 10:02:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-24 10:02:12,226 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:12,227 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:12,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:12,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-24 10:02:12,441 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1144230019, now seen corresponding path program 1 times [2021-10-24 10:02:12,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:12,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307289786] [2021-10-24 10:02:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:12,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:12,533 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:12,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307289786] [2021-10-24 10:02:12,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307289786] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:12,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176119091] [2021-10-24 10:02:12,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:12,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:12,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:12,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 10:02:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:12,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-24 10:02:12,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:13,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:13,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176119091] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:13,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:13,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [4] total 13 [2021-10-24 10:02:13,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203917724] [2021-10-24 10:02:13,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-24 10:02:13,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-24 10:02:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-24 10:02:13,204 INFO L87 Difference]: Start difference. First operand 6053 states and 8061 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10-24 10:02:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:14,450 INFO L93 Difference]: Finished difference Result 13608 states and 18150 transitions. [2021-10-24 10:02:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-24 10:02:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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 70 [2021-10-24 10:02:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:14,477 INFO L225 Difference]: With dead ends: 13608 [2021-10-24 10:02:14,477 INFO L226 Difference]: Without dead ends: 9672 [2021-10-24 10:02:14,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 490.8ms TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2021-10-24 10:02:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2021-10-24 10:02:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 5812. [2021-10-24 10:02:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5812 states, 5811 states have (on average 1.336258819480296) internal successors, (7765), 5811 states have internal predecessors, (7765), 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-10-24 10:02:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5812 states to 5812 states and 7765 transitions. [2021-10-24 10:02:14,966 INFO L78 Accepts]: Start accepts. Automaton has 5812 states and 7765 transitions. Word has length 70 [2021-10-24 10:02:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:14,966 INFO L470 AbstractCegarLoop]: Abstraction has 5812 states and 7765 transitions. [2021-10-24 10:02:14,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10-24 10:02:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5812 states and 7765 transitions. [2021-10-24 10:02:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-24 10:02:14,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:14,978 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:15,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:15,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-24 10:02:15,194 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:15,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1354715054, now seen corresponding path program 1 times [2021-10-24 10:02:15,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:15,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820427968] [2021-10-24 10:02:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:15,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:15,268 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:15,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820427968] [2021-10-24 10:02:15,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820427968] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:15,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961198774] [2021-10-24 10:02:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:15,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:15,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:15,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 10:02:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:15,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:02:15,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:15,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:15,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961198774] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:15,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:15,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 10:02:15,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821873286] [2021-10-24 10:02:15,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:15,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:02:15,884 INFO L87 Difference]: Start difference. First operand 5812 states and 7765 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 10:02:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:16,389 INFO L93 Difference]: Finished difference Result 12669 states and 16932 transitions. [2021-10-24 10:02:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 72 [2021-10-24 10:02:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:16,405 INFO L225 Difference]: With dead ends: 12669 [2021-10-24 10:02:16,405 INFO L226 Difference]: Without dead ends: 6898 [2021-10-24 10:02:16,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:02:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2021-10-24 10:02:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6155. [2021-10-24 10:02:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.3414039649008775) internal successors, (8255), 6154 states have internal predecessors, (8255), 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-10-24 10:02:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 8255 transitions. [2021-10-24 10:02:16,883 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 8255 transitions. Word has length 72 [2021-10-24 10:02:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:16,884 INFO L470 AbstractCegarLoop]: Abstraction has 6155 states and 8255 transitions. [2021-10-24 10:02:16,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 10:02:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 8255 transitions. [2021-10-24 10:02:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-24 10:02:16,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:16,896 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:16,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:17,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-24 10:02:17,109 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash 178836382, now seen corresponding path program 1 times [2021-10-24 10:02:17,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:17,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281410451] [2021-10-24 10:02:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:17,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:17,157 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:17,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281410451] [2021-10-24 10:02:17,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281410451] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:17,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136553426] [2021-10-24 10:02:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:17,158 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:17,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:17,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-24 10:02:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:17,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:02:17,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:17,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:17,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136553426] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:17,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:17,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 10:02:17,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498933403] [2021-10-24 10:02:17,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:17,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:17,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:02:17,780 INFO L87 Difference]: Start difference. First operand 6155 states and 8255 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 10:02:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:18,228 INFO L93 Difference]: Finished difference Result 11832 states and 15909 transitions. [2021-10-24 10:02:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 72 [2021-10-24 10:02:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:18,241 INFO L225 Difference]: With dead ends: 11832 [2021-10-24 10:02:18,241 INFO L226 Difference]: Without dead ends: 6705 [2021-10-24 10:02:18,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:02:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2021-10-24 10:02:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6181. [2021-10-24 10:02:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 6180 states have (on average 1.3435275080906148) internal successors, (8303), 6180 states have internal predecessors, (8303), 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-10-24 10:02:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 8303 transitions. [2021-10-24 10:02:18,629 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 8303 transitions. Word has length 72 [2021-10-24 10:02:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:18,630 INFO L470 AbstractCegarLoop]: Abstraction has 6181 states and 8303 transitions. [2021-10-24 10:02:18,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 10:02:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 8303 transitions. [2021-10-24 10:02:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-24 10:02:18,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:18,640 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:18,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:18,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-24 10:02:18,861 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1711425730, now seen corresponding path program 1 times [2021-10-24 10:02:18,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:18,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271246334] [2021-10-24 10:02:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:18,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:18,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:18,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271246334] [2021-10-24 10:02:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271246334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:18,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:18,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153657563] [2021-10-24 10:02:18,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:18,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:18,901 INFO L87 Difference]: Start difference. First operand 6181 states and 8303 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-10-24 10:02:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:19,236 INFO L93 Difference]: Finished difference Result 11127 states and 14982 transitions. [2021-10-24 10:02:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2021-10-24 10:02:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:19,246 INFO L225 Difference]: With dead ends: 11127 [2021-10-24 10:02:19,246 INFO L226 Difference]: Without dead ends: 5040 [2021-10-24 10:02:19,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2021-10-24 10:02:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4956. [2021-10-24 10:02:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.3089808274470232) internal successors, (6486), 4955 states have internal predecessors, (6486), 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-10-24 10:02:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6486 transitions. [2021-10-24 10:02:19,518 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6486 transitions. Word has length 72 [2021-10-24 10:02:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:19,519 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6486 transitions. [2021-10-24 10:02:19,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-10-24 10:02:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6486 transitions. [2021-10-24 10:02:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-24 10:02:19,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:19,525 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:19,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-24 10:02:19,525 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117887, now seen corresponding path program 1 times [2021-10-24 10:02:19,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:19,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66538967] [2021-10-24 10:02:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:19,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:19,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:19,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66538967] [2021-10-24 10:02:19,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66538967] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:19,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444054786] [2021-10-24 10:02:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:19,584 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:19,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:19,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-24 10:02:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:19,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-24 10:02:19,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:02:20,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:02:20,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444054786] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:20,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:20,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 8 [2021-10-24 10:02:20,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541334408] [2021-10-24 10:02:20,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:02:20,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:02:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:02:20,416 INFO L87 Difference]: Start difference. First operand 4956 states and 6486 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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-10-24 10:02:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:20,791 INFO L93 Difference]: Finished difference Result 8519 states and 11132 transitions. [2021-10-24 10:02:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:02:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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 72 [2021-10-24 10:02:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:20,799 INFO L225 Difference]: With dead ends: 8519 [2021-10-24 10:02:20,799 INFO L226 Difference]: Without dead ends: 5199 [2021-10-24 10:02:20,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:02:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2021-10-24 10:02:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4956. [2021-10-24 10:02:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.2952573158425833) internal successors, (6418), 4955 states have internal predecessors, (6418), 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-10-24 10:02:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6418 transitions. [2021-10-24 10:02:21,092 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6418 transitions. Word has length 72 [2021-10-24 10:02:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:21,092 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6418 transitions. [2021-10-24 10:02:21,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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-10-24 10:02:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6418 transitions. [2021-10-24 10:02:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-24 10:02:21,098 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:21,098 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:21,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-24 10:02:21,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-24 10:02:21,313 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 607011608, now seen corresponding path program 1 times [2021-10-24 10:02:21,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:21,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750965900] [2021-10-24 10:02:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:21,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 10:02:21,340 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:21,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750965900] [2021-10-24 10:02:21,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750965900] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:21,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:21,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:21,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158769579] [2021-10-24 10:02:21,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:21,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:21,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:21,343 INFO L87 Difference]: Start difference. First operand 4956 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-24 10:02:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:21,773 INFO L93 Difference]: Finished difference Result 11721 states and 15299 transitions. [2021-10-24 10:02:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:21,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 72 [2021-10-24 10:02:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:21,782 INFO L225 Difference]: With dead ends: 11721 [2021-10-24 10:02:21,783 INFO L226 Difference]: Without dead ends: 6779 [2021-10-24 10:02:21,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2021-10-24 10:02:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 5914. [2021-10-24 10:02:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5913 states have (on average 1.3006933874513784) internal successors, (7691), 5913 states have internal predecessors, (7691), 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-10-24 10:02:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7691 transitions. [2021-10-24 10:02:22,083 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7691 transitions. Word has length 72 [2021-10-24 10:02:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:22,084 INFO L470 AbstractCegarLoop]: Abstraction has 5914 states and 7691 transitions. [2021-10-24 10:02:22,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-24 10:02:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7691 transitions. [2021-10-24 10:02:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-24 10:02:22,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:22,088 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:22,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-24 10:02:22,088 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -859186428, now seen corresponding path program 1 times [2021-10-24 10:02:22,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:22,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883041590] [2021-10-24 10:02:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:22,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:22,153 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:22,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883041590] [2021-10-24 10:02:22,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883041590] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:22,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845034645] [2021-10-24 10:02:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:22,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:22,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:22,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-24 10:02:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:22,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-24 10:02:22,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:22,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:23,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845034645] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:23,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-10-24 10:02:23,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 13 [2021-10-24 10:02:23,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092176663] [2021-10-24 10:02:23,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:02:23,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:02:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-24 10:02:23,187 INFO L87 Difference]: Start difference. First operand 5914 states and 7691 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10-24 10:02:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:23,828 INFO L93 Difference]: Finished difference Result 14232 states and 18336 transitions. [2021-10-24 10:02:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:02:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2021-10-24 10:02:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:23,835 INFO L225 Difference]: With dead ends: 14232 [2021-10-24 10:02:23,835 INFO L226 Difference]: Without dead ends: 6298 [2021-10-24 10:02:23,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-24 10:02:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2021-10-24 10:02:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 5324. [2021-10-24 10:02:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.25605861356378) internal successors, (6686), 5323 states have internal predecessors, (6686), 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-10-24 10:02:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6686 transitions. [2021-10-24 10:02:24,100 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6686 transitions. Word has length 73 [2021-10-24 10:02:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:24,100 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6686 transitions. [2021-10-24 10:02:24,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10-24 10:02:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6686 transitions. [2021-10-24 10:02:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-24 10:02:24,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:24,103 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:24,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:24,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:24,317 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -272720491, now seen corresponding path program 1 times [2021-10-24 10:02:24,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:24,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297918737] [2021-10-24 10:02:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:24,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:24,361 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:24,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297918737] [2021-10-24 10:02:24,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297918737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:24,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:24,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:24,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13428126] [2021-10-24 10:02:24,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:24,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:24,363 INFO L87 Difference]: Start difference. First operand 5324 states and 6686 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-24 10:02:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:24,746 INFO L93 Difference]: Finished difference Result 10444 states and 13146 transitions. [2021-10-24 10:02:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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 73 [2021-10-24 10:02:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:24,752 INFO L225 Difference]: With dead ends: 10444 [2021-10-24 10:02:24,752 INFO L226 Difference]: Without dead ends: 6247 [2021-10-24 10:02:24,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6247 states. [2021-10-24 10:02:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6247 to 5324. [2021-10-24 10:02:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.2344542551192936) internal successors, (6571), 5323 states have internal predecessors, (6571), 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-10-24 10:02:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6571 transitions. [2021-10-24 10:02:25,185 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6571 transitions. Word has length 73 [2021-10-24 10:02:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:25,186 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6571 transitions. [2021-10-24 10:02:25,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-24 10:02:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6571 transitions. [2021-10-24 10:02:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-24 10:02:25,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:25,191 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:25,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-24 10:02:25,191 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1172145059, now seen corresponding path program 1 times [2021-10-24 10:02:25,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:25,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225131686] [2021-10-24 10:02:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:25,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:25,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:25,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225131686] [2021-10-24 10:02:25,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225131686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:25,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:25,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:02:25,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159052751] [2021-10-24 10:02:25,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:25,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:25,245 INFO L87 Difference]: Start difference. First operand 5324 states and 6571 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-10-24 10:02:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:25,797 INFO L93 Difference]: Finished difference Result 10865 states and 13384 transitions. [2021-10-24 10:02:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:25,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2021-10-24 10:02:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:25,805 INFO L225 Difference]: With dead ends: 10865 [2021-10-24 10:02:25,805 INFO L226 Difference]: Without dead ends: 6668 [2021-10-24 10:02:25,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2021-10-24 10:02:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 5579. [2021-10-24 10:02:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2228397275008964) internal successors, (6821), 5578 states have internal predecessors, (6821), 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-10-24 10:02:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6821 transitions. [2021-10-24 10:02:26,124 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6821 transitions. Word has length 75 [2021-10-24 10:02:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:26,124 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6821 transitions. [2021-10-24 10:02:26,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-10-24 10:02:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6821 transitions. [2021-10-24 10:02:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-24 10:02:26,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:26,128 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:26,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-24 10:02:26,128 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1736974502, now seen corresponding path program 1 times [2021-10-24 10:02:26,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:26,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761755875] [2021-10-24 10:02:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:26,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:26,174 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:26,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761755875] [2021-10-24 10:02:26,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761755875] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:26,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897970044] [2021-10-24 10:02:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:26,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:26,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:26,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-24 10:02:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:26,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-24 10:02:26,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:26,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:27,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897970044] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:27,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:27,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2021-10-24 10:02:27,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299801864] [2021-10-24 10:02:27,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:27,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:27,025 INFO L87 Difference]: Start difference. First operand 5579 states and 6821 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-10-24 10:02:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:27,321 INFO L93 Difference]: Finished difference Result 10818 states and 13218 transitions. [2021-10-24 10:02:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 93 [2021-10-24 10:02:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:27,327 INFO L225 Difference]: With dead ends: 10818 [2021-10-24 10:02:27,327 INFO L226 Difference]: Without dead ends: 5685 [2021-10-24 10:02:27,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2021-10-24 10:02:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5579. [2021-10-24 10:02:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2065256364288275) internal successors, (6730), 5578 states have internal predecessors, (6730), 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-10-24 10:02:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6730 transitions. [2021-10-24 10:02:27,703 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6730 transitions. Word has length 93 [2021-10-24 10:02:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:27,703 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6730 transitions. [2021-10-24 10:02:27,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-10-24 10:02:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6730 transitions. [2021-10-24 10:02:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-24 10:02:27,706 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:27,707 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:27,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:27,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:27,909 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash -623003666, now seen corresponding path program 1 times [2021-10-24 10:02:27,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:27,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568359952] [2021-10-24 10:02:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:27,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:27,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:27,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568359952] [2021-10-24 10:02:27,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568359952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:27,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:27,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:27,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504114189] [2021-10-24 10:02:27,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:27,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:27,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:27,952 INFO L87 Difference]: Start difference. First operand 5579 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-24 10:02:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:28,151 INFO L93 Difference]: Finished difference Result 8628 states and 10459 transitions. [2021-10-24 10:02:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2021-10-24 10:02:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:28,155 INFO L225 Difference]: With dead ends: 8628 [2021-10-24 10:02:28,155 INFO L226 Difference]: Without dead ends: 3503 [2021-10-24 10:02:28,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-10-24 10:02:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3483. [2021-10-24 10:02:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 1.163699023549684) internal successors, (4052), 3482 states have internal predecessors, (4052), 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-10-24 10:02:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4052 transitions. [2021-10-24 10:02:28,343 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4052 transitions. Word has length 94 [2021-10-24 10:02:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:28,344 INFO L470 AbstractCegarLoop]: Abstraction has 3483 states and 4052 transitions. [2021-10-24 10:02:28,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-24 10:02:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4052 transitions. [2021-10-24 10:02:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-24 10:02:28,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:28,346 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:28,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-24 10:02:28,346 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:28,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1036850775, now seen corresponding path program 1 times [2021-10-24 10:02:28,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:28,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005375029] [2021-10-24 10:02:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:28,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:02:28,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:28,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005375029] [2021-10-24 10:02:28,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005375029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:28,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:28,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:02:28,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961152852] [2021-10-24 10:02:28,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:28,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:28,402 INFO L87 Difference]: Start difference. First operand 3483 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-24 10:02:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:28,720 INFO L93 Difference]: Finished difference Result 7376 states and 8513 transitions. [2021-10-24 10:02:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:02:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2021-10-24 10:02:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:28,725 INFO L225 Difference]: With dead ends: 7376 [2021-10-24 10:02:28,725 INFO L226 Difference]: Without dead ends: 4352 [2021-10-24 10:02:28,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2021-10-24 10:02:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 3731. [2021-10-24 10:02:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1361930294906166) internal successors, (4238), 3730 states have internal predecessors, (4238), 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-10-24 10:02:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4238 transitions. [2021-10-24 10:02:28,917 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4238 transitions. Word has length 96 [2021-10-24 10:02:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:28,918 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4238 transitions. [2021-10-24 10:02:28,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-24 10:02:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4238 transitions. [2021-10-24 10:02:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-24 10:02:28,920 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:28,920 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:28,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-24 10:02:28,920 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1490254128, now seen corresponding path program 1 times [2021-10-24 10:02:28,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:28,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820935638] [2021-10-24 10:02:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:28,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 10:02:28,981 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:28,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820935638] [2021-10-24 10:02:28,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820935638] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:28,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567288925] [2021-10-24 10:02:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:28,982 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:28,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:28,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:29,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-24 10:02:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:29,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 10:02:29,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:02:29,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 10:02:30,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567288925] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:30,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:30,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [4] total 8 [2021-10-24 10:02:30,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822958806] [2021-10-24 10:02:30,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:02:30,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:02:30,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:02:30,661 INFO L87 Difference]: Start difference. First operand 3731 states and 4238 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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-10-24 10:02:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:31,061 INFO L93 Difference]: Finished difference Result 7406 states and 8389 transitions. [2021-10-24 10:02:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:02:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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 99 [2021-10-24 10:02:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:31,066 INFO L225 Difference]: With dead ends: 7406 [2021-10-24 10:02:31,066 INFO L226 Difference]: Without dead ends: 4543 [2021-10-24 10:02:31,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 52.1ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:02:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2021-10-24 10:02:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3731. [2021-10-24 10:02:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1329758713136728) internal successors, (4226), 3730 states have internal predecessors, (4226), 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-10-24 10:02:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4226 transitions. [2021-10-24 10:02:31,316 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4226 transitions. Word has length 99 [2021-10-24 10:02:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:31,316 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4226 transitions. [2021-10-24 10:02:31,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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-10-24 10:02:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4226 transitions. [2021-10-24 10:02:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-24 10:02:31,318 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:31,318 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:31,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:31,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-24 10:02:31,545 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1700743775, now seen corresponding path program 1 times [2021-10-24 10:02:31,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:31,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750369504] [2021-10-24 10:02:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:31,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:31,663 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:31,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750369504] [2021-10-24 10:02:31,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750369504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:31,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:31,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:02:31,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374041381] [2021-10-24 10:02:31,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:02:31,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:31,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:02:31,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:02:31,665 INFO L87 Difference]: Start difference. First operand 3731 states and 4226 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 10:02:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:32,491 INFO L93 Difference]: Finished difference Result 12497 states and 14274 transitions. [2021-10-24 10:02:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:02:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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 118 [2021-10-24 10:02:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:32,510 INFO L225 Difference]: With dead ends: 12497 [2021-10-24 10:02:32,510 INFO L226 Difference]: Without dead ends: 10471 [2021-10-24 10:02:32,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:02:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10471 states. [2021-10-24 10:02:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10471 to 6505. [2021-10-24 10:02:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6505 states, 6504 states have (on average 1.1432964329643296) internal successors, (7436), 6504 states have internal predecessors, (7436), 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-10-24 10:02:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 7436 transitions. [2021-10-24 10:02:32,928 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 7436 transitions. Word has length 118 [2021-10-24 10:02:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:32,929 INFO L470 AbstractCegarLoop]: Abstraction has 6505 states and 7436 transitions. [2021-10-24 10:02:32,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 10:02:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 7436 transitions. [2021-10-24 10:02:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-10-24 10:02:32,932 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:32,932 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:32,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-24 10:02:32,932 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1926987636, now seen corresponding path program 1 times [2021-10-24 10:02:32,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:32,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542436696] [2021-10-24 10:02:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:32,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-24 10:02:32,969 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:32,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542436696] [2021-10-24 10:02:32,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542436696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:32,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:32,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:02:32,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548538396] [2021-10-24 10:02:32,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:02:32,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:02:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:32,972 INFO L87 Difference]: Start difference. First operand 6505 states and 7436 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-10-24 10:02:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:33,509 INFO L93 Difference]: Finished difference Result 13519 states and 15527 transitions. [2021-10-24 10:02:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:02:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 123 [2021-10-24 10:02:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:33,516 INFO L225 Difference]: With dead ends: 13519 [2021-10-24 10:02:33,516 INFO L226 Difference]: Without dead ends: 7228 [2021-10-24 10:02:33,520 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:02:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2021-10-24 10:02:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 6512. [2021-10-24 10:02:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 6511 states have (on average 1.155582859775764) internal successors, (7524), 6511 states have internal predecessors, (7524), 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-10-24 10:02:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7524 transitions. [2021-10-24 10:02:33,911 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7524 transitions. Word has length 123 [2021-10-24 10:02:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:33,911 INFO L470 AbstractCegarLoop]: Abstraction has 6512 states and 7524 transitions. [2021-10-24 10:02:33,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-10-24 10:02:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7524 transitions. [2021-10-24 10:02:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-10-24 10:02:33,914 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:33,914 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:33,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-24 10:02:33,914 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash -175805878, now seen corresponding path program 1 times [2021-10-24 10:02:33,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:33,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542972376] [2021-10-24 10:02:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:33,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-24 10:02:33,963 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:33,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542972376] [2021-10-24 10:02:33,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542972376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:33,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:33,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:02:33,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152486758] [2021-10-24 10:02:33,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:33,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:33,966 INFO L87 Difference]: Start difference. First operand 6512 states and 7524 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10-24 10:02:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:34,321 INFO L93 Difference]: Finished difference Result 10459 states and 12009 transitions. [2021-10-24 10:02:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:02:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 143 [2021-10-24 10:02:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:34,326 INFO L225 Difference]: With dead ends: 10459 [2021-10-24 10:02:34,326 INFO L226 Difference]: Without dead ends: 4519 [2021-10-24 10:02:34,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-10-24 10:02:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4105. [2021-10-24 10:02:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4104 states have (on average 1.1401072124756335) internal successors, (4679), 4104 states have internal predecessors, (4679), 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-10-24 10:02:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 4679 transitions. [2021-10-24 10:02:34,602 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 4679 transitions. Word has length 143 [2021-10-24 10:02:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:34,602 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 4679 transitions. [2021-10-24 10:02:34,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10-24 10:02:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 4679 transitions. [2021-10-24 10:02:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-24 10:02:34,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:34,606 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:34,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-24 10:02:34,606 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1597127135, now seen corresponding path program 1 times [2021-10-24 10:02:34,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:34,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230064118] [2021-10-24 10:02:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:34,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-24 10:02:34,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:34,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230064118] [2021-10-24 10:02:34,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230064118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:34,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:02:34,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:02:34,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974588753] [2021-10-24 10:02:34,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:02:34,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:02:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:02:34,663 INFO L87 Difference]: Start difference. First operand 4105 states and 4679 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-10-24 10:02:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:35,035 INFO L93 Difference]: Finished difference Result 7055 states and 8004 transitions. [2021-10-24 10:02:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:02:35,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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 144 [2021-10-24 10:02:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:35,039 INFO L225 Difference]: With dead ends: 7055 [2021-10-24 10:02:35,039 INFO L226 Difference]: Without dead ends: 3410 [2021-10-24 10:02:35,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:02:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2021-10-24 10:02:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3093. [2021-10-24 10:02:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3092 states have (on average 1.1345407503234153) internal successors, (3508), 3092 states have internal predecessors, (3508), 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-10-24 10:02:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 3508 transitions. [2021-10-24 10:02:35,320 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 3508 transitions. Word has length 144 [2021-10-24 10:02:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:35,320 INFO L470 AbstractCegarLoop]: Abstraction has 3093 states and 3508 transitions. [2021-10-24 10:02:35,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-10-24 10:02:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 3508 transitions. [2021-10-24 10:02:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-10-24 10:02:35,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:02:35,323 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:02:35,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-24 10:02:35,323 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:02:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:02:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash 262470301, now seen corresponding path program 1 times [2021-10-24 10:02:35,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:02:35,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393194068] [2021-10-24 10:02:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:35,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:02:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:02:35,441 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:02:35,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393194068] [2021-10-24 10:02:35,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393194068] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:02:35,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721508777] [2021-10-24 10:02:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:02:35,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:02:35,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:02:35,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:02:35,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-24 10:02:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:02:36,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-24 10:02:36,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:02:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-24 10:02:36,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:02:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-24 10:02:36,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721508777] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:02:36,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 10:02:36,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 11 [2021-10-24 10:02:36,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769380021] [2021-10-24 10:02:36,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:02:36,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:02:36,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:02:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-24 10:02:36,624 INFO L87 Difference]: Start difference. First operand 3093 states and 3508 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-10-24 10:02:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:02:36,796 INFO L93 Difference]: Finished difference Result 3716 states and 4199 transitions. [2021-10-24 10:02:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:02:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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 145 [2021-10-24 10:02:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:02:36,797 INFO L225 Difference]: With dead ends: 3716 [2021-10-24 10:02:36,797 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 10:02:36,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 44.2ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-24 10:02:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 10:02:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 10:02:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10-24 10:02:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 10:02:36,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2021-10-24 10:02:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:02:36,799 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 10:02:36,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-10-24 10:02:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 10:02:36,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 10:02:36,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:02:36,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-24 10:02:37,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-10-24 10:02:37,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-24 10:02:37,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:37,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:37,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:37,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:37,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:40,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:40,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:40,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:41,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:41,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:41,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:42,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:45,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:45,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:45,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:45,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:46,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:46,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:47,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:47,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:47,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:47,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:47,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:51,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:02:53,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:03:12,283 WARN L207 SmtUtils]: Spent 5.08 s on a formula simplification. DAG size of input: 685 DAG size of output: 155 [2021-10-24 10:03:24,618 WARN L207 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 827 DAG size of output: 167 [2021-10-24 10:03:32,266 INFO L853 garLoopResultBuilder]: At program point L103-1(lines 91 122) the Hoare annotation is: (let ((.cse30 (+ ~local~0 1)) (.cse22 (= ~t3_pc~0 1)) (.cse4 (= ~t2_pc~0 1))) (let ((.cse27 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse0 (= ~m_st~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse29 (<= 2 ~t2_st~0)) (.cse28 (<= 2 ~t3_st~0)) (.cse25 (= 0 ~t2_pc~0)) (.cse26 (not .cse4)) (.cse17 (= 2 ~t3_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse15 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse22)) (.cse18 (<= ~token~0 .cse30)) (.cse3 (= ~E_3~0 2)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse30 ~token~0)) (.cse7 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 (or (and .cse17 .cse18 .cse3 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse12 .cse13 .cse22) (and .cse17 .cse18 .cse3 .cse23 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse24 .cse13 .cse22)) .cse9) (and .cse17 .cse3 .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse16 .cse3 .cse5 .cse6 .cse7 .cse20 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse20 .cse15 .cse25 .cse8 .cse21 .cse12 .cse13 .cse14) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14 .cse27) (and .cse2 (= ~E_3~0 ~E_1~0) .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse16 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse12 .cse13 .cse14) (and .cse17 .cse16 .cse1 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse24 .cse13 .cse22 .cse27) (and .cse28 .cse20 .cse15 .cse8 .cse29 .cse24 .cse13 .cse22) (and .cse17 .cse0 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse22) (and .cse2 .cse20 .cse15 .cse8 .cse29 .cse12 .cse13 .cse14) (and .cse28 .cse20 .cse15 .cse25 .cse8 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse1 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse24 .cse13 .cse22) (and .cse16 .cse2 .cse18 .cse3 .cse23 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,267 INFO L853 garLoopResultBuilder]: At program point L368(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 1)) (.cse23 (= ~t2_pc~0 1))) (let ((.cse0 (= ~m_st~0 2)) (.cse27 (<= 2 ~t3_st~0)) (.cse30 (not .cse23)) (.cse31 (<= ~token~0 .cse35)) (.cse32 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse33 (<= .cse35 ~token~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse28 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse29 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 .cse32 .cse23 .cse4 .cse5 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (let ((.cse34 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse34 ~token~0) (<= ~token~0 .cse34) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse17 .cse18 (or (and .cse15 .cse16 .cse31 .cse2 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse31 .cse2 .cse32 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21))) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse28 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,267 INFO L857 garLoopResultBuilder]: For program point L238(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,267 INFO L857 garLoopResultBuilder]: For program point L238-2(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-3(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-5(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-6(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-8(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-9(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-11(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-12(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,268 INFO L857 garLoopResultBuilder]: For program point L238-14(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L238-15(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L238-17(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L238-18(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L238-20(lines 238 247) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L371(lines 371 378) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,269 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L239-2(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L239-3(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L239-4(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L239-5(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L239-6(lines 239 244) no Hoare annotation was computed. [2021-10-24 10:03:32,270 INFO L857 garLoopResultBuilder]: For program point L702(lines 702 706) no Hoare annotation was computed. [2021-10-24 10:03:32,271 INFO L853 garLoopResultBuilder]: At program point L175-1(lines 163 194) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse0)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse18 (= ~m_st~0 2)) (.cse17 (< 0 ~t3_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse22 (= 2 ~t1_st~0)) (.cse1 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse15 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse5 .cse15 .cse7 (<= 2 ~t2_st~0) .cse16 .cse12) (and .cse13 .cse17 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse18 .cse19 .cse17 .cse1 .cse14 .cse20 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse21 (<= (+ 3 ~local~0) ~token~0) .cse19 .cse22 .cse1 .cse20 .cse2 .cse4 .cse7 .cse16 .cse12 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse22 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse19 .cse13 .cse14 .cse20 .cse23 .cse4 .cse15 .cse7 .cse9 .cse10 .cse16 .cse12) (let ((.cse24 (+ ~local~0 1))) (and .cse0 .cse21 (<= ~token~0 .cse24) .cse22 .cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse20 .cse2 .cse3 (<= .cse24 ~token~0) .cse4 .cse5 .cse7 .cse8 .cse16 .cse12)) (and .cse13 .cse17 .cse14 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse18 .cse17 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse21 .cse19 .cse22 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse12) (and .cse0 .cse21 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse0 .cse19 .cse22 .cse1 .cse20 .cse4 .cse15 .cse7 .cse16 .cse12) (and .cse0 .cse5 .cse15 .cse7 .cse16 .cse12)))) [2021-10-24 10:03:32,271 INFO L860 garLoopResultBuilder]: At program point L708(lines 655 713) the Hoare annotation is: true [2021-10-24 10:03:32,271 INFO L857 garLoopResultBuilder]: For program point L48(lines 48 56) no Hoare annotation was computed. [2021-10-24 10:03:32,271 INFO L853 garLoopResultBuilder]: At program point L249(lines 237 251) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-24 10:03:32,272 INFO L853 garLoopResultBuilder]: At program point L249-1(lines 237 251) the Hoare annotation is: (let ((.cse12 (= ~t3_pc~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse18 (not .cse12)) (.cse15 (= ~t2_pc~0 1)) (.cse19 (= 0 ~t3_st~0)) (.cse1 (= 2 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~E_3~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= 0 ~t2_pc~0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse12 .cse13) (and .cse1 .cse16 .cse14 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse0 .cse14 .cse18 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse18 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse14 .cse18 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-10-24 10:03:32,272 INFO L853 garLoopResultBuilder]: At program point L249-2(lines 237 251) the Hoare annotation is: (let ((.cse7 (= ~t3_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse10 (= 2 ~t2_st~0)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse12 (not (= ~E_3~0 1))) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= 2 ~t3_st~0)) (.cse22 (<= ~token~0 .cse25)) (.cse13 (= ~t2_pc~0 1)) (.cse24 (<= .cse25 ~token~0)) (.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (not .cse7)) (.cse11 (= ~E_3~0 2)) (.cse14 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse20 (= 0 ~t2_pc~0)) (.cse4 (= ~E_M~0 2)) (.cse15 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse6 (= ~E_1~0 2)) (.cse19 (= 0 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19 .cse16) (and .cse0 .cse8 .cse9 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse17 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19) (and .cse9 (or (and .cse0 .cse8 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse22 .cse11 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse21 .cse18 .cse6 .cse7)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse19) (and .cse0 .cse9 .cse17 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse19 .cse16)))) [2021-10-24 10:03:32,272 INFO L853 garLoopResultBuilder]: At program point L249-3(lines 237 251) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-24 10:03:32,273 INFO L853 garLoopResultBuilder]: At program point L249-4(lines 237 251) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-24 10:03:32,273 INFO L853 garLoopResultBuilder]: At program point L249-5(lines 237 251) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4)) .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6 .cse15))) [2021-10-24 10:03:32,273 INFO L857 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2021-10-24 10:03:32,273 INFO L853 garLoopResultBuilder]: At program point L249-6(lines 237 251) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,274 INFO L853 garLoopResultBuilder]: At program point L382(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse23 (= ~t2_pc~0 1)) (.cse36 (+ ~local~0 1))) (let ((.cse34 (<= ~token~0 .cse36)) (.cse35 (<= .cse36 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse30 (<= 2 ~t3_st~0)) (.cse33 (not .cse23)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse31 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse29 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse32 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse17 (let ((.cse28 (+ 2 ~local~0))) (let ((.cse26 (<= .cse28 ~token~0)) (.cse27 (<= ~token~0 .cse28))) (or (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse14 .cse21) (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)))) .cse18) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse8 .cse31 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse34 .cse18 .cse2 .cse23 .cse4 .cse35 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse34 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse35 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse31 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,274 INFO L853 garLoopResultBuilder]: At program point L52(lines 47 86) the Hoare annotation is: (and (= ~t1_pc~0 1) (= 2 ~t3_st~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_3~0 2) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2) (= ~t3_pc~0 1) (< ~token~0 (+ ~local~0 4))) [2021-10-24 10:03:32,274 INFO L857 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2021-10-24 10:03:32,274 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-24 10:03:32,274 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,274 INFO L857 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,274 INFO L857 garLoopResultBuilder]: For program point L257-3(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-5(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-6(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-8(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-9(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-11(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-12(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-14(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-15(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-17(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-18(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L257-20(lines 257 266) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,275 INFO L857 garLoopResultBuilder]: For program point L258-2(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L857 garLoopResultBuilder]: For program point L258-3(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L857 garLoopResultBuilder]: For program point L258-4(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L857 garLoopResultBuilder]: For program point L258-5(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L857 garLoopResultBuilder]: For program point L258-6(lines 258 263) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-10-24 10:03:32,276 INFO L853 garLoopResultBuilder]: At program point L131(lines 131 135) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 2 ~t1_st~0)) (.cse12 (= ~E_3~0 2)) (.cse1 (< 0 ~t2_st~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse15 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse9 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse9) (and .cse0 .cse10 (not .cse9) .cse11 .cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse1 .cse13 .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse15 .cse2 .cse4 .cse5 .cse6 .cse7) (let ((.cse16 (+ ~local~0 1))) (and .cse0 (= 2 ~t3_st~0) .cse10 (<= ~token~0 .cse16) .cse11 .cse12 .cse1 .cse13 .cse14 (<= .cse16 ~token~0) .cse15 .cse2 .cse4 .cse8 .cse6 .cse9)))) [2021-10-24 10:03:32,277 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-24 10:03:32,277 INFO L853 garLoopResultBuilder]: At program point L396(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse30 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse28 (<= 2 ~t2_st~0)) (.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse26 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse19 (not (= ~E_3~0 1))) (.cse22 (not .cse15)) (.cse27 (<= 2 ~t3_st~0)) (.cse3 (= ~t1_st~0 0)) (.cse24 (= ~m_pc~0 0)) (.cse25 (not .cse30)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse29 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse14) (and .cse15 .cse1 .cse20 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse21) (and .cse16 .cse0 .cse29 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse29 .cse1 .cse18 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse13 .cse21) (and .cse16 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse13 .cse21) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse31 .cse18 .cse2 .cse30 .cse4 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse21) (let ((.cse33 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14 .cse21)) (and .cse15 .cse29 .cse1 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse14) (and .cse29 .cse1 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 .cse13 .cse21) (and .cse15 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse14) (and .cse15 .cse29 .cse1 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse30 .cse4 .cse5 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse16 .cse29 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 (not .cse3) .cse10 .cse11 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse8 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,277 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,277 INFO L857 garLoopResultBuilder]: For program point L200-2(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-3(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-5(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-6(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-8(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-9(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-11(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-12(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-14(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-15(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-17(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,278 INFO L857 garLoopResultBuilder]: For program point L200-18(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L200-20(lines 200 209) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 406) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-1(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-2(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-3(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-4(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-5(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L857 garLoopResultBuilder]: For program point L201-6(lines 201 206) no Hoare annotation was computed. [2021-10-24 10:03:32,279 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-24 10:03:32,279 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (let ((.cse14 (= ~t3_pc~0 1))) (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_st~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse16 (= ~t1_pc~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse17 (not .cse14)) (.cse2 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse19 .cse17 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse16 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse19 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14 .cse15) (and .cse16 .cse19 .cse17 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15)))) [2021-10-24 10:03:32,279 INFO L853 garLoopResultBuilder]: At program point L268-2(lines 256 270) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse16 (= 0 ~t2_pc~0)) (.cse24 (= ~m_pc~0 0)) (.cse3 (= 2 ~t2_st~0)) (.cse19 (not .cse14)) (.cse23 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse20 (<= ~token~0 .cse25)) (.cse4 (= ~E_3~0 2)) (.cse21 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse22 (<= .cse25 ~token~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse11 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse19 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23) (and .cse0 .cse7 .cse8 .cse9 .cse24 .cse10 .cse18 .cse13 .cse23) (and .cse0 .cse2 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23 .cse15) (and .cse0 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse23 .cse15) (and .cse2 (or (and .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14)) .cse11)))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L268-3(lines 256 270) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse8 (= 0 ~t3_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= 2 ~t1_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse14 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2)) (.cse16 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (let ((.cse17 (+ 2 ~local~0))) (let ((.cse9 (<= .cse17 ~token~0)) (.cse10 (<= ~token~0 .cse17))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse15 .cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse16) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse16)))) .cse18 .cse19) (and .cse0 .cse18 (not .cse16) .cse19 .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse16) (and .cse0 (= 2 ~t3_st~0) .cse18 .cse19 (not (= ~E_3~0 1)) .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse15 .cse7 .cse16))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L268-4(lines 256 270) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L268-5(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L268-6(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L139-1(lines 127 158) the Hoare annotation is: (let ((.cse17 (< 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse27 (= 2 ~t3_st~0)) (.cse11 (not (= ~E_3~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse2 (not (= ~m_st~0 0))) (.cse29 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse4 (= ~E_M~0 2)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse25 (= ~t3_pc~0 1))) (let ((.cse28 (= ~m_st~0 2)) (.cse18 (= ~E_3~0 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t1_st~0)) (.cse30 (or (and .cse0 .cse27 .cse17 .cse11 .cse12 .cse2 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse11 .cse12 .cse2 .cse29 .cse4 .cse24 .cse6 .cse25))) (.cse1 (not .cse25)) (.cse10 (= ~E_3~0 2)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse15 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse3 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse8 .cse9 (let ((.cse26 (+ 2 ~local~0))) (let ((.cse21 (<= .cse26 ~token~0)) (.cse22 (<= ~token~0 .cse26)) (.cse23 (= ~t2_pc~0 1))) (or (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse24 .cse6 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse7 .cse25) (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25))))) (and .cse27 .cse28 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse9 .cse10 .cse14 (or (and .cse0 .cse27 .cse29 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse17 .cse3 .cse4 .cse24 .cse6 .cse25))) (and .cse10 .cse14 .cse19 .cse20 .cse30) (and .cse28 .cse1 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse27 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse8 .cse9 .cse10 .cse14 .cse30) (and .cse0 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse1 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse15 (<= 2 ~t3_st~0) .cse16 .cse17 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25)))) [2021-10-24 10:03:32,280 INFO L853 garLoopResultBuilder]: At program point L73(lines 47 86) the Hoare annotation is: (let ((.cse11 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse2 (= 2 ~t2_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t3_st~0)) (.cse13 (not .cse0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse12 (not .cse11)) (.cse3 (= 2 ~t1_st~0)) (.cse15 (= ~E_3~0 ~E_1~0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse16 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse22 (= 0 ~t2_st~0)) (.cse19 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse10 (= ~E_1~0 2)) (.cse20 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse2 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse12 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse20)))) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L670-1(lines 465 707) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse2 (not .cse12) (not .cse0) .cse17 (= ~E_3~0 ~E_1~0) .cse8 .cse9 .cse16 (= 0 ~t2_pc~0) .cse10 (= 0 ~t2_st~0) .cse18 .cse19 .cse11 (= 0 ~t3_st~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not .cse17) .cse18 .cse19 .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,281 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211(lines 199 213) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 199 213) the Hoare annotation is: (let ((.cse17 (= ~t3_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse15 (= 2 ~t3_st~0)) (.cse0 (= 2 ~t2_st~0)) (.cse2 (not .cse14)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~t2_pc~0 1)) (.cse1 (not .cse17)) (.cse16 (= 2 ~t1_st~0)) (.cse3 (= ~E_3~0 2)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse18 (= 0 ~t2_pc~0)) (.cse9 (= ~E_M~0 2)) (.cse19 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse15 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse0 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse1 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13)))) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211-2(lines 199 213) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1)) (.cse19 (= ~t3_pc~0 1))) (let ((.cse2 (not .cse19)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (<= ~token~0 .cse21)) (.cse5 (= ~t2_pc~0 1)) (.cse8 (<= .cse21 ~token~0)) (.cse18 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse4 (= ~E_3~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse15 (= 0 ~t2_pc~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (not (= ~t1_st~0 0))) (.cse16 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse18 .cse13 .cse19) (and .cse0 .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse19) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse20 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse19)))) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211-3(lines 199 213) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211-4(lines 199 213) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse10 (= ~E_2~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 (or (and .cse0 .cse4 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse7 .cse9 .cse12 .cse13 .cse14 (= ~E_M~0 1))) .cse3 .cse5 .cse6 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-24 10:03:32,281 INFO L853 garLoopResultBuilder]: At program point L211-5(lines 199 213) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (= ~E_3~0 2)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6) (and .cse0 .cse7 .cse14 (<= (+ 3 ~local~0) ~token~0) .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6))) [2021-10-24 10:03:32,282 INFO L853 garLoopResultBuilder]: At program point L211-6(lines 199 213) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,282 INFO L853 garLoopResultBuilder]: At program point L411(lines 338 416) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse13 (not (= ~E_3~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9 .cse10) (and .cse0 .cse1 .cse12 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L349-1(lines 344 410) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-2(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-3(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-5(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-6(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-8(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-9(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,282 INFO L857 garLoopResultBuilder]: For program point L219-11(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-12(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-14(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-15(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-17(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-18(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L219-20(lines 219 228) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-2(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-3(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-4(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-5(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,283 INFO L857 garLoopResultBuilder]: For program point L220-6(lines 220 225) no Hoare annotation was computed. [2021-10-24 10:03:32,284 INFO L853 garLoopResultBuilder]: At program point L354(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse33 (+ ~local~0 1))) (let ((.cse29 (<= ~token~0 .cse33)) (.cse30 (<= .cse33 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse28 (<= 2 ~t3_st~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse32 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse23 (= ~t2_pc~0 1)) (.cse27 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse23 .cse4 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse29 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (let ((.cse31 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse31 ~token~0) (<= ~token~0 .cse31) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse15 .cse22 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,284 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 100) no Hoare annotation was computed. [2021-10-24 10:03:32,284 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-10-24 10:03:32,284 INFO L853 garLoopResultBuilder]: At program point L689(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,285 INFO L853 garLoopResultBuilder]: At program point L689-1(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,285 INFO L853 garLoopResultBuilder]: At program point L95(lines 95 99) the Hoare annotation is: (let ((.cse20 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse26 (<= 2 ~t2_st~0)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse21 (not .cse15)) (.cse25 (<= 2 ~t3_st~0)) (.cse19 (= 2 ~t3_st~0)) (.cse0 (= ~m_st~0 2)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= 0 ~t2_st~0)) (.cse23 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t2_st~0)) (.cse2 (not .cse20)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse3 .cse5 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse2 .cse21 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse21 .cse25 .cse16 .cse23 .cse8 .cse26 .cse24 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse16 .cse23 .cse8 .cse26 .cse12 .cse13 .cse14) (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse19 .cse1 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse21 .cse25 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse0 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse24 .cse13 .cse20) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,285 INFO L853 garLoopResultBuilder]: At program point L230(lines 218 232) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-10-24 10:03:32,285 INFO L853 garLoopResultBuilder]: At program point L230-1(lines 218 232) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse19 (not .cse14)) (.cse17 (= 2 ~t1_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse20 (= 0 ~t3_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse2 (not .cse15)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t1_st~0 0)) (.cse18 (= ~t2_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14) (and .cse15 .cse0 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse16 .cse19 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse19 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse19 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14)))) [2021-10-24 10:03:32,286 INFO L853 garLoopResultBuilder]: At program point L230-2(lines 218 232) the Hoare annotation is: (let ((.cse22 (+ ~local~0 1)) (.cse13 (= ~t3_pc~0 1))) (let ((.cse7 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse14 (not .cse13)) (.cse20 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse15 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse17 (<= ~token~0 .cse22)) (.cse3 (= ~E_3~0 2)) (.cse18 (= ~t2_pc~0 1)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse22 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse2 .cse16 .cse14 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse11 .cse12 .cse15) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse21 .cse12 .cse13) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse21 .cse12 .cse13)))) [2021-10-24 10:03:32,286 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 172) no Hoare annotation was computed. [2021-10-24 10:03:32,286 INFO L853 garLoopResultBuilder]: At program point L230-3(lines 218 232) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-24 10:03:32,287 INFO L853 garLoopResultBuilder]: At program point L230-4(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (= ~E_2~0 2)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 (< ~token~0 (+ ~local~0 4))))) [2021-10-24 10:03:32,287 INFO L853 garLoopResultBuilder]: At program point L230-5(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse13 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 .cse10 .cse11))) [2021-10-24 10:03:32,287 INFO L853 garLoopResultBuilder]: At program point L230-6(lines 218 232) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-24 10:03:32,287 INFO L853 garLoopResultBuilder]: At program point L167(lines 167 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse28 (= ~t3_pc~0 1))) (let ((.cse12 (= ~m_st~0 2)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse24 (not (= ~E_3~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse2 (not .cse28)) (.cse21 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse18 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse20 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse25 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse13 .cse6 .cse14 .cse15 .cse7 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse15 .cse7 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse1 .cse2 .cse21 .cse4 .cse13 .cse6 .cse22 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse10 .cse11) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse9 (<= 2 ~t2_st~0) .cse10 .cse11) (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse23 .cse2 (<= ~token~0 .cse26) .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse6 .cse14 .cse15 (<= .cse26 ~token~0) .cse7 .cse25 .cse9 .cse19 .cse10 .cse11)) (let ((.cse27 (+ 2 ~local~0))) (and .cse0 .cse23 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 .cse28)) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse4 .cse25 .cse8 .cse9 .cse10 .cse11)))) [2021-10-24 10:03:32,292 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:03:32,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:03:32 BoogieIcfgContainer [2021-10-24 10:03:32,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:03:32,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:03:32,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:03:32,422 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:03:32,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:01:59" (3/4) ... [2021-10-24 10:03:32,426 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 10:03:32,448 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 140 nodes and edges [2021-10-24 10:03:32,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-24 10:03:32,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-24 10:03:32,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-24 10:03:32,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:03:32,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:03:32,641 INFO L168 Benchmark]: Toolchain (without parser) took 95520.02 ms. Allocated memory was 117.4 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 87.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 594.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,641 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 117.4 MB. Free memory is still 73.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:03:32,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.66 ms. Allocated memory is still 117.4 MB. Free memory was 87.0 MB in the beginning and 88.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.21 ms. Allocated memory is still 117.4 MB. Free memory was 88.8 MB in the beginning and 85.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,643 INFO L168 Benchmark]: Boogie Preprocessor took 77.47 ms. Allocated memory is still 117.4 MB. Free memory was 85.0 MB in the beginning and 82.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,643 INFO L168 Benchmark]: RCFGBuilder took 2019.13 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 82.0 MB in the beginning and 93.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 54.3 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,644 INFO L168 Benchmark]: TraceAbstraction took 92782.27 ms. Allocated memory was 142.6 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 93.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,644 INFO L168 Benchmark]: Witness Printer took 218.11 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:03:32,646 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.22 ms. Allocated memory is still 117.4 MB. Free memory is still 73.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 341.66 ms. Allocated memory is still 117.4 MB. Free memory was 87.0 MB in the beginning and 88.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.21 ms. Allocated memory is still 117.4 MB. Free memory was 88.8 MB in the beginning and 85.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.47 ms. Allocated memory is still 117.4 MB. Free memory was 85.0 MB in the beginning and 82.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2019.13 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 82.0 MB in the beginning and 93.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 54.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 92782.27 ms. Allocated memory was 142.6 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 93.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 218.11 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 92578.2ms, OverallIterations: 31, TraceHistogramMax: 4, EmptinessCheckTime: 214.3ms, AutomataDifference: 14491.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 55260.6ms, InitialAbstractionConstructionTime: 13.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7575 SDtfs, 10257 SDslu, 11528 SDs, 0 SdLazy, 2003 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1717.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1725 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1286.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10124occurred in iteration=10, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 9240.7ms AutomataMinimizationTime, 31 MinimizatonAttempts, 33745 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 1402 NumberOfFragments, 16803 HoareAnnotationTreeSize, 46 FomulaSimplifications, 8469378 FormulaSimplificationTreeSizeReduction, 17019.8ms HoareSimplificationTime, 46 FomulaSimplificationsInter, 637506 FormulaSimplificationTreeSizeReductionInter, 38182.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 349.4ms SsaConstructionTime, 1016.8ms SatisfiabilityAnalysisTime, 6918.7ms InterpolantComputationTime, 3230 NumberOfCodeBlocks, 3230 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4008 ConstructedInterpolants, 0 QuantifiedInterpolants, 9477 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3923 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 51 InterpolantComputations, 40 PerfectInterpolantSequences, 959/989 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || ((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)))) || (((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((2 == t1_st && E_3 == 2) && E_2 == 2) && ((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((E_3 == 2 && E_2 == 2) && token <= local) && local <= token) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || (((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((__retres1 == 0 && 2 == t1_st) && E_3 == 2) && E_2 == 2) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((2 == t2_st && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((((((2 == t3_st && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((!(t3_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((2 == t3_st && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) && __retres1 == 0) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1))) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || ((((((t1_pc == 1 && 0 < t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) || (((((((!(t1_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 2 == t2_st) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && token < local + 4) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((__retres1 == 0 && 3 + local <= token) && 2 == t2_st) && ((((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && E_M == 1))) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && token < local + 4) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == t3_st && __retres1 == 0) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) || ((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0)) RESULT: Ultimate proved your program to be correct! [2021-10-24 10:03:32,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ef16539-147f-482f-8430-fe6562723832/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...