./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh --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 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:19:43,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:19:43,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:19:43,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:19:43,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:19:43,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:19:43,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:19:43,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:19:43,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:19:43,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:19:43,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:19:43,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:19:43,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:19:43,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:19:43,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:19:43,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:19:43,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:19:43,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:19:43,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:19:44,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:19:44,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:19:44,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:19:44,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:19:44,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:19:44,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:19:44,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:19:44,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:19:44,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:19:44,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:19:44,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:19:44,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:19:44,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:19:44,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:19:44,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:19:44,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:19:44,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:19:44,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:19:44,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:19:44,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:19:44,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:19:44,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:19:44,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:19:44,036 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:19:44,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:19:44,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:19:44,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:19:44,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:19:44,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:19:44,043 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:19:44,044 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:19:44,044 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:19:44,044 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:19:44,044 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:19:44,044 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:19:44,045 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:19:44,045 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:19:44,045 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:19:44,045 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:19:44,045 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:19:44,046 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:19:44,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:19:44,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:19:44,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:19:44,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:19:44,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:19:44,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:19:44,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:19:44,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:19:44,048 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:19:44,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:19:44,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:19:44,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:19:44,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:19:44,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:19:44,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:19:44,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:19:44,050 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:19:44,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:19:44,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:19:44,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:19:44,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:19:44,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:19:44,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:19:44,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/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_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh 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 -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2022-12-14 14:19:44,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:19:44,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:19:44,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:19:44,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:19:44,257 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:19:44,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-12-14 14:19:46,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:19:46,940 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:19:46,940 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-12-14 14:19:46,947 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/data/3e13296da/fd9e17b027db4179b41bc082174bd383/FLAG3a9b6f18c [2022-12-14 14:19:47,351 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/data/3e13296da/fd9e17b027db4179b41bc082174bd383 [2022-12-14 14:19:47,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:19:47,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:19:47,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:19:47,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:19:47,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:19:47,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56212216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47, skipping insertion in model container [2022-12-14 14:19:47,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:19:47,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:19:47,542 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-12-14 14:19:47,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:19:47,555 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:19:47,600 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-12-14 14:19:47,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:19:47,611 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:19:47,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47 WrapperNode [2022-12-14 14:19:47,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:19:47,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:19:47,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:19:47,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:19:47,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,655 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-12-14 14:19:47,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:19:47,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:19:47,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:19:47,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:19:47,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,680 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:19:47,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:19:47,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:19:47,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:19:47,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (1/1) ... [2022-12-14 14:19:47,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:19:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:19:47,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:19:47,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:19:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:19:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:19:47,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:19:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:19:47,804 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:19:47,805 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:19:48,322 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:19:48,338 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:19:48,338 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 14:19:48,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:19:48 BoogieIcfgContainer [2022-12-14 14:19:48,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:19:48,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:19:48,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:19:48,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:19:48,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:19:47" (1/3) ... [2022-12-14 14:19:48,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c6a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:19:48, skipping insertion in model container [2022-12-14 14:19:48,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:19:47" (2/3) ... [2022-12-14 14:19:48,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c6a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:19:48, skipping insertion in model container [2022-12-14 14:19:48,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:19:48" (3/3) ... [2022-12-14 14:19:48,347 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-12-14 14:19:48,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:19:48,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 14:19:48,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:19:48,405 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@209e9f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:19:48,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 14:19:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.9714285714285715) internal successors, (207), 106 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:19:48,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:48,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:48,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1655152119, now seen corresponding path program 1 times [2022-12-14 14:19:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712323854] [2022-12-14 14:19:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:48,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:48,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712323854] [2022-12-14 14:19:48,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712323854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:48,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:48,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:19:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721578082] [2022-12-14 14:19:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:19:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:19:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:19:48,561 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.9714285714285715) internal successors, (207), 106 states have internal predecessors, (207), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:48,590 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2022-12-14 14:19:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:19:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-12-14 14:19:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:48,598 INFO L225 Difference]: With dead ends: 213 [2022-12-14 14:19:48,598 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 14:19:48,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:19:48,603 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:48,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:19:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 14:19:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-12-14 14:19:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 103 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 174 transitions. [2022-12-14 14:19:48,629 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 174 transitions. Word has length 8 [2022-12-14 14:19:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:48,629 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 174 transitions. [2022-12-14 14:19:48,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2022-12-14 14:19:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:19:48,630 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:48,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:48,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:19:48,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 762379355, now seen corresponding path program 1 times [2022-12-14 14:19:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:48,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710685697] [2022-12-14 14:19:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:48,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:48,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710685697] [2022-12-14 14:19:48,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710685697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:48,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:48,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:19:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478595591] [2022-12-14 14:19:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:19:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:19:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:48,686 INFO L87 Difference]: Start difference. First operand 104 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:48,727 INFO L93 Difference]: Finished difference Result 210 states and 351 transitions. [2022-12-14 14:19:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:19:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-12-14 14:19:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:48,729 INFO L225 Difference]: With dead ends: 210 [2022-12-14 14:19:48,730 INFO L226 Difference]: Without dead ends: 107 [2022-12-14 14:19:48,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:48,731 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:48,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 323 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:19:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-14 14:19:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-12-14 14:19:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.669811320754717) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 177 transitions. [2022-12-14 14:19:48,747 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 177 transitions. Word has length 9 [2022-12-14 14:19:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:48,748 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 177 transitions. [2022-12-14 14:19:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 177 transitions. [2022-12-14 14:19:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:19:48,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:48,749 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:48,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:19:48,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash -197013714, now seen corresponding path program 1 times [2022-12-14 14:19:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:48,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702881085] [2022-12-14 14:19:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:49,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702881085] [2022-12-14 14:19:49,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702881085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:49,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:49,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:19:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28338740] [2022-12-14 14:19:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:19:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:19:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:19:49,297 INFO L87 Difference]: Start difference. First operand 107 states and 177 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:49,531 INFO L93 Difference]: Finished difference Result 218 states and 355 transitions. [2022-12-14 14:19:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:19:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:19:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:49,534 INFO L225 Difference]: With dead ends: 218 [2022-12-14 14:19:49,534 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 14:19:49,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:19:49,535 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:49,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 519 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:19:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 14:19:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-12-14 14:19:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.6571428571428573) internal successors, (290), 175 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 290 transitions. [2022-12-14 14:19:49,543 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 290 transitions. Word has length 14 [2022-12-14 14:19:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:49,543 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 290 transitions. [2022-12-14 14:19:49,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 290 transitions. [2022-12-14 14:19:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:19:49,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:49,544 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:49,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:19:49,544 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 938789430, now seen corresponding path program 1 times [2022-12-14 14:19:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141713734] [2022-12-14 14:19:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:49,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:49,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141713734] [2022-12-14 14:19:49,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141713734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:49,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:49,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:19:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249608686] [2022-12-14 14:19:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:49,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:19:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:19:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:49,569 INFO L87 Difference]: Start difference. First operand 176 states and 290 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:49,598 INFO L93 Difference]: Finished difference Result 302 states and 496 transitions. [2022-12-14 14:19:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:19:49,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:19:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:49,599 INFO L225 Difference]: With dead ends: 302 [2022-12-14 14:19:49,599 INFO L226 Difference]: Without dead ends: 128 [2022-12-14 14:19:49,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:49,600 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:49,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 295 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:19:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-14 14:19:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-12-14 14:19:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.624) internal successors, (203), 125 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 203 transitions. [2022-12-14 14:19:49,606 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 203 transitions. Word has length 15 [2022-12-14 14:19:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:49,606 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 203 transitions. [2022-12-14 14:19:49,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 203 transitions. [2022-12-14 14:19:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:19:49,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:49,607 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:49,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:19:49,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1693191315, now seen corresponding path program 1 times [2022-12-14 14:19:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693306122] [2022-12-14 14:19:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:19:49,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693306122] [2022-12-14 14:19:49,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693306122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:49,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:49,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:19:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052098167] [2022-12-14 14:19:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:49,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:19:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:19:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:49,644 INFO L87 Difference]: Start difference. First operand 126 states and 203 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:49,675 INFO L93 Difference]: Finished difference Result 257 states and 414 transitions. [2022-12-14 14:19:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:19:49,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2022-12-14 14:19:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:49,677 INFO L225 Difference]: With dead ends: 257 [2022-12-14 14:19:49,677 INFO L226 Difference]: Without dead ends: 133 [2022-12-14 14:19:49,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:49,679 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 34 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:49,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 294 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:19:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-14 14:19:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-12-14 14:19:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.6) internal successors, (208), 130 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 208 transitions. [2022-12-14 14:19:49,684 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 208 transitions. Word has length 20 [2022-12-14 14:19:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:49,684 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 208 transitions. [2022-12-14 14:19:49,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 208 transitions. [2022-12-14 14:19:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 14:19:49,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:49,684 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:49,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:19:49,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1475234708, now seen corresponding path program 1 times [2022-12-14 14:19:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323323445] [2022-12-14 14:19:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:49,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:49,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323323445] [2022-12-14 14:19:49,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323323445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:49,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522646721] [2022-12-14 14:19:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:19:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:19:49,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:19:49,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:19:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:49,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:19:49,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:49,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:49,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522646721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:19:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [459868122] [2022-12-14 14:19:49,872 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-12-14 14:19:49,872 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:19:49,875 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:19:49,879 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:19:49,879 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:19:51,123 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:19:52,528 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2190#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (= 3 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:19:52,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:19:52,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:19:52,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-14 14:19:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188238974] [2022-12-14 14:19:52,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:19:52,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:19:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:19:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:19:52,530 INFO L87 Difference]: Start difference. First operand 131 states and 208 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:52,656 INFO L93 Difference]: Finished difference Result 248 states and 393 transitions. [2022-12-14 14:19:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:19:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 14:19:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:52,657 INFO L225 Difference]: With dead ends: 248 [2022-12-14 14:19:52,657 INFO L226 Difference]: Without dead ends: 233 [2022-12-14 14:19:52,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:19:52,659 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 316 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:52,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 826 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:19:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-12-14 14:19:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2022-12-14 14:19:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6428571428571428) internal successors, (345), 210 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 345 transitions. [2022-12-14 14:19:52,669 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 345 transitions. Word has length 22 [2022-12-14 14:19:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:52,670 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 345 transitions. [2022-12-14 14:19:52,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 345 transitions. [2022-12-14 14:19:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 14:19:52,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:52,671 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:52,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:19:52,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 14:19:52,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1500920786, now seen corresponding path program 1 times [2022-12-14 14:19:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:52,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310440064] [2022-12-14 14:19:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:53,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:53,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310440064] [2022-12-14 14:19:53,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310440064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945263550] [2022-12-14 14:19:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:53,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:19:53,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:19:53,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:19:53,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:19:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:53,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 14:19:53,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:53,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:19:53,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945263550] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:19:53,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [806106624] [2022-12-14 14:19:53,441 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 14:19:53,441 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:19:53,441 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:19:53,441 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:19:53,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:19:54,364 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:19:55,965 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2835#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (or (and (not (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P3~0#1| 0)) (and (= |ULTIMATE.start_main_~P3~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (= 3 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:19:55,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:19:55,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:19:55,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2022-12-14 14:19:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302543513] [2022-12-14 14:19:55,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:19:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:19:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:55,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:19:55,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:19:55,967 INFO L87 Difference]: Start difference. First operand 211 states and 345 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:56,065 INFO L93 Difference]: Finished difference Result 235 states and 377 transitions. [2022-12-14 14:19:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:19:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 14:19:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:56,066 INFO L225 Difference]: With dead ends: 235 [2022-12-14 14:19:56,066 INFO L226 Difference]: Without dead ends: 231 [2022-12-14 14:19:56,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:19:56,067 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 106 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:56,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 723 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:19:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-14 14:19:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-12-14 14:19:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6228070175438596) internal successors, (370), 228 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 370 transitions. [2022-12-14 14:19:56,072 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 370 transitions. Word has length 23 [2022-12-14 14:19:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:56,073 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 370 transitions. [2022-12-14 14:19:56,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 370 transitions. [2022-12-14 14:19:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:19:56,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:56,073 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:56,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:19:56,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 14:19:56,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1554530707, now seen corresponding path program 1 times [2022-12-14 14:19:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141329496] [2022-12-14 14:19:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 14:19:56,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141329496] [2022-12-14 14:19:56,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141329496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:19:56,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:19:56,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:19:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103048874] [2022-12-14 14:19:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:19:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:19:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:19:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:19:56,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:56,336 INFO L87 Difference]: Start difference. First operand 229 states and 370 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:56,362 INFO L93 Difference]: Finished difference Result 428 states and 688 transitions. [2022-12-14 14:19:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:19:56,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 14:19:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:56,364 INFO L225 Difference]: With dead ends: 428 [2022-12-14 14:19:56,364 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 14:19:56,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:19:56,365 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 69 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:56,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 202 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:19:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 14:19:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2022-12-14 14:19:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 198 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 311 transitions. [2022-12-14 14:19:56,370 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 311 transitions. Word has length 29 [2022-12-14 14:19:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:56,370 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 311 transitions. [2022-12-14 14:19:56,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:19:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 311 transitions. [2022-12-14 14:19:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:19:56,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:56,371 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:56,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:19:56,371 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:19:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2135712591, now seen corresponding path program 1 times [2022-12-14 14:19:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:19:56,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711644713] [2022-12-14 14:19:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:19:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:19:56,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:19:56,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711644713] [2022-12-14 14:19:56,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711644713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:56,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934796287] [2022-12-14 14:19:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:19:56,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:19:56,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:19:56,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:19:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:56,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 14:19:56,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 14:19:56,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:19:56,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934796287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:19:56,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676690786] [2022-12-14 14:19:56,883 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-12-14 14:19:56,883 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:19:56,883 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:19:56,883 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:19:56,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:19:57,789 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:00,035 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4210#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:00,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:00,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:00,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-12-14 14:20:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491648274] [2022-12-14 14:20:00,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:00,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 14:20:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 14:20:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:20:00,037 INFO L87 Difference]: Start difference. First operand 199 states and 311 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:00,542 INFO L93 Difference]: Finished difference Result 596 states and 919 transitions. [2022-12-14 14:20:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:20:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 32 [2022-12-14 14:20:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:00,545 INFO L225 Difference]: With dead ends: 596 [2022-12-14 14:20:00,545 INFO L226 Difference]: Without dead ends: 415 [2022-12-14 14:20:00,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:20:00,546 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 618 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:00,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1016 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:20:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-12-14 14:20:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 349. [2022-12-14 14:20:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5804597701149425) internal successors, (550), 348 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 550 transitions. [2022-12-14 14:20:00,555 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 550 transitions. Word has length 32 [2022-12-14 14:20:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:00,555 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 550 transitions. [2022-12-14 14:20:00,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 550 transitions. [2022-12-14 14:20:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 14:20:00,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:00,556 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:20:00,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:20:00,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:00,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1771134383, now seen corresponding path program 1 times [2022-12-14 14:20:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:00,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020851038] [2022-12-14 14:20:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:20:00,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:00,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020851038] [2022-12-14 14:20:00,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020851038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:00,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268377626] [2022-12-14 14:20:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:00,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:00,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:20:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:00,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 14:20:00,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:20:00,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:20:01,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268377626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:01,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1410733557] [2022-12-14 14:20:01,002 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 14:20:01,002 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:01,003 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:01,003 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:01,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:01,872 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:04,013 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5461#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:04,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:04,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:04,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-12-14 14:20:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656535016] [2022-12-14 14:20:04,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:04,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:20:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:20:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:20:04,014 INFO L87 Difference]: Start difference. First operand 349 states and 550 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:04,074 INFO L93 Difference]: Finished difference Result 363 states and 562 transitions. [2022-12-14 14:20:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:20:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 14:20:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:04,075 INFO L225 Difference]: With dead ends: 363 [2022-12-14 14:20:04,075 INFO L226 Difference]: Without dead ends: 351 [2022-12-14 14:20:04,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:20:04,076 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 220 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:04,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 421 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:20:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-12-14 14:20:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-12-14 14:20:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5344827586206897) internal successors, (534), 348 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 534 transitions. [2022-12-14 14:20:04,082 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 534 transitions. Word has length 33 [2022-12-14 14:20:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:04,082 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 534 transitions. [2022-12-14 14:20:04,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 534 transitions. [2022-12-14 14:20:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 14:20:04,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:04,083 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2022-12-14 14:20:04,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:20:04,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 14:20:04,285 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -886789566, now seen corresponding path program 1 times [2022-12-14 14:20:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591405751] [2022-12-14 14:20:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:04,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:04,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591405751] [2022-12-14 14:20:04,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591405751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:04,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813758161] [2022-12-14 14:20:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:04,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:04,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:04,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:04,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:20:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:04,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 14:20:04,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:04,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813758161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1576674414] [2022-12-14 14:20:05,050 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 14:20:05,051 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:05,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:05,051 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:05,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:05,896 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:08,912 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6454#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:08,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:08,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:08,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2022-12-14 14:20:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218727829] [2022-12-14 14:20:08,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:20:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:20:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:20:08,914 INFO L87 Difference]: Start difference. First operand 349 states and 534 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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) [2022-12-14 14:20:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:09,066 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2022-12-14 14:20:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:20:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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 35 [2022-12-14 14:20:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:09,068 INFO L225 Difference]: With dead ends: 376 [2022-12-14 14:20:09,068 INFO L226 Difference]: Without dead ends: 374 [2022-12-14 14:20:09,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:20:09,069 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 116 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:09,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 905 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:20:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-12-14 14:20:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 349. [2022-12-14 14:20:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5316091954022988) internal successors, (533), 348 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 533 transitions. [2022-12-14 14:20:09,076 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 533 transitions. Word has length 35 [2022-12-14 14:20:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:09,076 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 533 transitions. [2022-12-14 14:20:09,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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) [2022-12-14 14:20:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 533 transitions. [2022-12-14 14:20:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 14:20:09,076 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:09,077 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2022-12-14 14:20:09,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 14:20:09,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 14:20:09,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1595435041, now seen corresponding path program 1 times [2022-12-14 14:20:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:09,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071356544] [2022-12-14 14:20:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 14:20:09,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:09,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071356544] [2022-12-14 14:20:09,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071356544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:20:09,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:20:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:20:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127754490] [2022-12-14 14:20:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:20:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:20:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:20:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:20:09,301 INFO L87 Difference]: Start difference. First operand 349 states and 533 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:09,331 INFO L93 Difference]: Finished difference Result 669 states and 1016 transitions. [2022-12-14 14:20:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:20:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 14:20:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:09,333 INFO L225 Difference]: With dead ends: 669 [2022-12-14 14:20:09,333 INFO L226 Difference]: Without dead ends: 361 [2022-12-14 14:20:09,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:20:09,334 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:09,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 234 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:20:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-12-14 14:20:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2022-12-14 14:20:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.488826815642458) internal successors, (533), 358 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2022-12-14 14:20:09,347 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 36 [2022-12-14 14:20:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:09,347 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2022-12-14 14:20:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2022-12-14 14:20:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 14:20:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:09,348 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2022-12-14 14:20:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:20:09,348 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 852693590, now seen corresponding path program 1 times [2022-12-14 14:20:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783399344] [2022-12-14 14:20:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 14:20:09,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:09,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783399344] [2022-12-14 14:20:09,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783399344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:20:09,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:20:09,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:20:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925935108] [2022-12-14 14:20:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:20:09,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:20:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:09,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:20:09,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:20:09,386 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:09,415 INFO L93 Difference]: Finished difference Result 463 states and 685 transitions. [2022-12-14 14:20:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:20:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-12-14 14:20:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:09,416 INFO L225 Difference]: With dead ends: 463 [2022-12-14 14:20:09,417 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 14:20:09,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:20:09,417 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:09,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:20:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 14:20:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-12-14 14:20:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4490740740740742) internal successors, (313), 216 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 313 transitions. [2022-12-14 14:20:09,426 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 313 transitions. Word has length 47 [2022-12-14 14:20:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:09,426 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 313 transitions. [2022-12-14 14:20:09,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 313 transitions. [2022-12-14 14:20:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 14:20:09,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:09,427 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2022-12-14 14:20:09,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 14:20:09,427 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1301360374, now seen corresponding path program 1 times [2022-12-14 14:20:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:09,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135552701] [2022-12-14 14:20:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 14:20:09,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:09,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135552701] [2022-12-14 14:20:09,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135552701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:09,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994923038] [2022-12-14 14:20:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:09,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:09,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:09,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:09,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:20:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:09,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 14:20:09,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 14:20:09,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:20:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994923038] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:10,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1696811248] [2022-12-14 14:20:10,192 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 14:20:10,192 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:10,192 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:10,192 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:10,192 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:11,123 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:14,605 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9384#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (not (= |ULTIMATE.start_main_~P1~0#1| 0)) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (not (= |ULTIMATE.start_main_~P8~0#1| 1)) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= |ULTIMATE.start_main_~P1~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (not (= |ULTIMATE.start_main_~P8~0#1| 0)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (= 6 |ULTIMATE.start_main_~method_id~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~P8~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))' at error location [2022-12-14 14:20:14,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:14,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 12 [2022-12-14 14:20:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004667297] [2022-12-14 14:20:14,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:20:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:20:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1623, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 14:20:14,607 INFO L87 Difference]: Start difference. First operand 217 states and 313 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:14,898 INFO L93 Difference]: Finished difference Result 322 states and 450 transitions. [2022-12-14 14:20:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:20:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 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 49 [2022-12-14 14:20:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:14,900 INFO L225 Difference]: With dead ends: 322 [2022-12-14 14:20:14,900 INFO L226 Difference]: Without dead ends: 315 [2022-12-14 14:20:14,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=313, Invalid=2039, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 14:20:14,901 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 710 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:14,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 892 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:20:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-12-14 14:20:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 272. [2022-12-14 14:20:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4538745387453875) internal successors, (394), 271 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 394 transitions. [2022-12-14 14:20:14,907 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 394 transitions. Word has length 49 [2022-12-14 14:20:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:14,907 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 394 transitions. [2022-12-14 14:20:14,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2022-12-14 14:20:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 14:20:14,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:14,908 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2022-12-14 14:20:14,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:20:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:15,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1676014596, now seen corresponding path program 1 times [2022-12-14 14:20:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254061032] [2022-12-14 14:20:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:15,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254061032] [2022-12-14 14:20:15,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254061032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907374295] [2022-12-14 14:20:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:15,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:15,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:20:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:15,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:20:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:15,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907374295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169976571] [2022-12-14 14:20:16,051 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:20:16,051 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:16,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:16,051 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:16,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:17,045 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:20,759 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10380#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:20,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:20,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:20,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-12-14 14:20:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771200799] [2022-12-14 14:20:20,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:20,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:20:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:20:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 14:20:20,761 INFO L87 Difference]: Start difference. First operand 272 states and 394 transitions. Second operand has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 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) [2022-12-14 14:20:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:20,933 INFO L93 Difference]: Finished difference Result 281 states and 399 transitions. [2022-12-14 14:20:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:20:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 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 50 [2022-12-14 14:20:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:20,934 INFO L225 Difference]: With dead ends: 281 [2022-12-14 14:20:20,934 INFO L226 Difference]: Without dead ends: 278 [2022-12-14 14:20:20,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=252, Invalid=1910, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 14:20:20,935 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 220 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:20,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 943 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:20:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-14 14:20:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2022-12-14 14:20:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4391143911439115) internal successors, (390), 271 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 390 transitions. [2022-12-14 14:20:20,944 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 390 transitions. Word has length 50 [2022-12-14 14:20:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:20,944 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 390 transitions. [2022-12-14 14:20:20,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 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) [2022-12-14 14:20:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 390 transitions. [2022-12-14 14:20:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 14:20:20,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:20,944 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 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] [2022-12-14 14:20:20,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 14:20:21,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:20:21,145 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1374353121, now seen corresponding path program 1 times [2022-12-14 14:20:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:21,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769516438] [2022-12-14 14:20:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:21,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:21,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769516438] [2022-12-14 14:20:21,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769516438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:21,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282468142] [2022-12-14 14:20:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:21,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:21,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:20:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:21,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 14:20:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:21,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:22,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282468142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:22,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1586552198] [2022-12-14 14:20:22,239 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:20:22,239 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:22,240 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:22,240 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:22,240 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:23,360 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:26,751 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11360#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:26,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:26,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:26,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 17 [2022-12-14 14:20:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609645898] [2022-12-14 14:20:26,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:26,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 14:20:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 14:20:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 14:20:26,753 INFO L87 Difference]: Start difference. First operand 272 states and 390 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:26,934 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2022-12-14 14:20:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:20:26,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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 56 [2022-12-14 14:20:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:26,936 INFO L225 Difference]: With dead ends: 282 [2022-12-14 14:20:26,936 INFO L226 Difference]: Without dead ends: 279 [2022-12-14 14:20:26,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=275, Invalid=2275, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 14:20:26,938 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 255 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:26,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1216 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:20:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-14 14:20:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-12-14 14:20:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4280442804428044) internal successors, (387), 271 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 387 transitions. [2022-12-14 14:20:26,944 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 387 transitions. Word has length 56 [2022-12-14 14:20:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:26,945 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 387 transitions. [2022-12-14 14:20:26,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 387 transitions. [2022-12-14 14:20:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 14:20:26,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:26,945 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 5, 5, 3, 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] [2022-12-14 14:20:26,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:20:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:20:27,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash 806051951, now seen corresponding path program 1 times [2022-12-14 14:20:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329218777] [2022-12-14 14:20:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 14:20:27,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329218777] [2022-12-14 14:20:27,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329218777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396033945] [2022-12-14 14:20:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:27,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:27,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:20:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:27,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:20:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:28,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:28,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396033945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:28,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [547268167] [2022-12-14 14:20:28,516 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:20:28,516 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:28,517 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:28,517 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:28,517 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:29,650 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:32,983 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12472#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:32,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:32,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:32,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-12-14 14:20:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184671976] [2022-12-14 14:20:32,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:32,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 14:20:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 14:20:32,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2682, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 14:20:32,985 INFO L87 Difference]: Start difference. First operand 272 states and 387 transitions. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:33,212 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2022-12-14 14:20:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:20:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 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 77 [2022-12-14 14:20:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:33,214 INFO L225 Difference]: With dead ends: 299 [2022-12-14 14:20:33,214 INFO L226 Difference]: Without dead ends: 294 [2022-12-14 14:20:33,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=303, Invalid=2889, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 14:20:33,215 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 335 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:33,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 2300 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:20:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-12-14 14:20:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-12-14 14:20:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4158075601374571) internal successors, (412), 291 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2022-12-14 14:20:33,222 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 77 [2022-12-14 14:20:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:33,222 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2022-12-14 14:20:33,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2022-12-14 14:20:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 14:20:33,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:33,223 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:20:33,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:20:33,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 14:20:33,425 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1627393088, now seen corresponding path program 1 times [2022-12-14 14:20:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:33,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781364042] [2022-12-14 14:20:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 14:20:34,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781364042] [2022-12-14 14:20:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781364042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731876620] [2022-12-14 14:20:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:34,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:34,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:34,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:20:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 14:20:34,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 14:20:34,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 28 proven. 330 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 14:20:35,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731876620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657476107] [2022-12-14 14:20:35,930 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 14:20:35,930 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:35,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:35,930 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:35,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:37,190 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:40,666 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13942#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:40,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:40,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:40,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 16] total 23 [2022-12-14 14:20:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801900980] [2022-12-14 14:20:40,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:40,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 14:20:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 14:20:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2832, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 14:20:40,669 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:41,333 INFO L93 Difference]: Finished difference Result 605 states and 858 transitions. [2022-12-14 14:20:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:20:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 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 130 [2022-12-14 14:20:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:41,335 INFO L225 Difference]: With dead ends: 605 [2022-12-14 14:20:41,335 INFO L226 Difference]: Without dead ends: 587 [2022-12-14 14:20:41,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 357 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=475, Invalid=3685, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 14:20:41,336 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 2050 mSDsluCounter, 2812 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:41,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 3127 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:20:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-12-14 14:20:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 550. [2022-12-14 14:20:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4517304189435336) internal successors, (797), 549 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 797 transitions. [2022-12-14 14:20:41,349 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 797 transitions. Word has length 130 [2022-12-14 14:20:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:41,349 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 797 transitions. [2022-12-14 14:20:41,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 797 transitions. [2022-12-14 14:20:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 14:20:41,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:41,350 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:20:41,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 14:20:41,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:41,551 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1630818142, now seen corresponding path program 1 times [2022-12-14 14:20:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:41,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312108237] [2022-12-14 14:20:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 335 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 14:20:42,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312108237] [2022-12-14 14:20:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312108237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804266250] [2022-12-14 14:20:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:42,487 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:42,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:20:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:42,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 14:20:42,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:42,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:20:43,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804266250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:43,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231643264] [2022-12-14 14:20:43,886 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:20:43,886 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:43,886 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:43,887 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:43,887 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:45,101 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:48,812 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16075#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:48,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:48,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:48,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 33 [2022-12-14 14:20:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151494344] [2022-12-14 14:20:48,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:48,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:20:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:20:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3951, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 14:20:48,814 INFO L87 Difference]: Start difference. First operand 550 states and 797 transitions. Second operand has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:49,660 INFO L93 Difference]: Finished difference Result 578 states and 817 transitions. [2022-12-14 14:20:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 14:20:49,661 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 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 134 [2022-12-14 14:20:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:49,662 INFO L225 Difference]: With dead ends: 578 [2022-12-14 14:20:49,662 INFO L226 Difference]: Without dead ends: 564 [2022-12-14 14:20:49,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=424, Invalid=5276, Unknown=0, NotChecked=0, Total=5700 [2022-12-14 14:20:49,664 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 989 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:49,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 5661 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:20:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-14 14:20:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 550. [2022-12-14 14:20:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4171220400728597) internal successors, (778), 549 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 778 transitions. [2022-12-14 14:20:49,675 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 778 transitions. Word has length 134 [2022-12-14 14:20:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:49,676 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 778 transitions. [2022-12-14 14:20:49,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 778 transitions. [2022-12-14 14:20:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 14:20:49,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:49,677 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:20:49,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 14:20:49,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:49,877 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1759770873, now seen corresponding path program 2 times [2022-12-14 14:20:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:49,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631845933] [2022-12-14 14:20:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:20:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 382 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 14:20:51,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:20:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631845933] [2022-12-14 14:20:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631845933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:20:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628666335] [2022-12-14 14:20:51,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:20:51,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:20:51,402 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:20:51,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:20:51,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 14:20:51,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:20:51,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:20:51,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:20:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 14:20:51,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:20:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 85 proven. 323 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 14:20:52,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628666335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:20:52,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [405209077] [2022-12-14 14:20:52,456 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:20:52,456 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:20:52,456 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:20:52,456 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:20:52,456 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:20:53,754 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:20:56,902 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18213#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:20:56,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:20:56,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:20:56,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 28 [2022-12-14 14:20:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012878031] [2022-12-14 14:20:56,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:20:56,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 14:20:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:20:56,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 14:20:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3257, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 14:20:56,904 INFO L87 Difference]: Start difference. First operand 550 states and 778 transitions. Second operand has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:20:59,252 INFO L93 Difference]: Finished difference Result 819 states and 1129 transitions. [2022-12-14 14:20:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-14 14:20:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 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 140 [2022-12-14 14:20:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:20:59,255 INFO L225 Difference]: With dead ends: 819 [2022-12-14 14:20:59,255 INFO L226 Difference]: Without dead ends: 817 [2022-12-14 14:20:59,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1614, Invalid=11726, Unknown=0, NotChecked=0, Total=13340 [2022-12-14 14:20:59,259 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 1589 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:20:59,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 4289 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:20:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-12-14 14:20:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 551. [2022-12-14 14:20:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.410909090909091) internal successors, (776), 550 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 776 transitions. [2022-12-14 14:20:59,284 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 776 transitions. Word has length 140 [2022-12-14 14:20:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:20:59,285 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 776 transitions. [2022-12-14 14:20:59,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:20:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 776 transitions. [2022-12-14 14:20:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 14:20:59,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:20:59,287 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:20:59,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 14:20:59,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:20:59,488 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:20:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:20:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 385745929, now seen corresponding path program 2 times [2022-12-14 14:20:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:20:59,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680028177] [2022-12-14 14:20:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:20:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:20:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:21:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 14:21:01,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:21:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680028177] [2022-12-14 14:21:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680028177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:21:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705909004] [2022-12-14 14:21:01,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:21:01,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:21:01,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:21:01,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:21:01,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:21:01,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 14:21:01,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:21:01,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:21:01,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:21:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 14:21:01,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:21:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 54 proven. 521 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:21:04,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705909004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:21:04,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751921380] [2022-12-14 14:21:04,293 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:21:04,294 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:21:04,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:21:04,294 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:21:04,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:21:05,557 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:21:09,205 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '20871#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:21:09,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:21:09,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:21:09,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 20] total 30 [2022-12-14 14:21:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307453517] [2022-12-14 14:21:09,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:21:09,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 14:21:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:21:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 14:21:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=3417, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 14:21:09,207 INFO L87 Difference]: Start difference. First operand 551 states and 776 transitions. Second operand has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:21:11,873 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2022-12-14 14:21:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-14 14:21:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 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 161 [2022-12-14 14:21:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:21:11,874 INFO L225 Difference]: With dead ends: 712 [2022-12-14 14:21:11,874 INFO L226 Difference]: Without dead ends: 702 [2022-12-14 14:21:11,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 461 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1565, Invalid=9355, Unknown=0, NotChecked=0, Total=10920 [2022-12-14 14:21:11,876 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 3122 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3122 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:21:11,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3122 Valid, 5286 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:21:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-12-14 14:21:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 662. [2022-12-14 14:21:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.411497730711044) internal successors, (933), 661 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 933 transitions. [2022-12-14 14:21:11,897 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 933 transitions. Word has length 161 [2022-12-14 14:21:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:21:11,897 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 933 transitions. [2022-12-14 14:21:11,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 933 transitions. [2022-12-14 14:21:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-12-14 14:21:11,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:21:11,899 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:21:11,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:21:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:21:12,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:21:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:21:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 473554572, now seen corresponding path program 2 times [2022-12-14 14:21:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:21:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758645244] [2022-12-14 14:21:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:21:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:21:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:21:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 14:21:19,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:21:19,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758645244] [2022-12-14 14:21:19,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758645244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:21:19,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560039928] [2022-12-14 14:21:19,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:21:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:21:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:21:19,766 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:21:19,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:21:20,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-12-14 14:21:20,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:21:20,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 14:21:20,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:21:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 14:21:20,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:21:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2024 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 14:21:21,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560039928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:21:21,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2094796281] [2022-12-14 14:21:21,717 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 14:21:21,717 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:21:21,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:21:21,717 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:21:21,717 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:21:22,964 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:21:26,522 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '24335#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:21:26,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:21:26,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:21:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 34] total 56 [2022-12-14 14:21:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061640987] [2022-12-14 14:21:26,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:21:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 14:21:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:21:26,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 14:21:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=6811, Unknown=0, NotChecked=0, Total=8010 [2022-12-14 14:21:26,526 INFO L87 Difference]: Start difference. First operand 662 states and 933 transitions. Second operand has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:21:27,630 INFO L93 Difference]: Finished difference Result 784 states and 1087 transitions. [2022-12-14 14:21:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 14:21:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 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 298 [2022-12-14 14:21:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:21:27,632 INFO L225 Difference]: With dead ends: 784 [2022-12-14 14:21:27,632 INFO L226 Difference]: Without dead ends: 775 [2022-12-14 14:21:27,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 842 SyntacticMatches, 22 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4631 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1743, Invalid=10029, Unknown=0, NotChecked=0, Total=11772 [2022-12-14 14:21:27,634 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 2162 mSDsluCounter, 8196 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 8874 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:21:27,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 8874 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:21:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-12-14 14:21:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 698. [2022-12-14 14:21:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4088952654232425) internal successors, (982), 697 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 982 transitions. [2022-12-14 14:21:27,653 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 982 transitions. Word has length 298 [2022-12-14 14:21:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:21:27,653 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 982 transitions. [2022-12-14 14:21:27,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:21:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 982 transitions. [2022-12-14 14:21:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-12-14 14:21:27,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:21:27,655 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:21:27,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 14:21:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:21:27,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:21:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:21:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1459913490, now seen corresponding path program 2 times [2022-12-14 14:21:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:21:27,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171579360] [2022-12-14 14:21:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:21:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:21:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:21:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2059 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 14:21:32,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:21:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171579360] [2022-12-14 14:21:32,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171579360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:21:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384199938] [2022-12-14 14:21:32,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:21:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:21:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:21:32,206 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:21:32,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 14:21:32,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-12-14 14:21:32,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:21:32,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-14 14:21:32,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:21:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2075 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 14:21:33,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:21:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 203 proven. 1958 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:21:43,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384199938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:21:43,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174652884] [2022-12-14 14:21:43,189 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:21:43,190 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:21:43,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:21:43,190 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:21:43,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:21:44,481 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:21:49,179 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '27897#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:21:49,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:21:49,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:21:49,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 43] total 74 [2022-12-14 14:21:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869193139] [2022-12-14 14:21:49,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:21:49,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-14 14:21:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:21:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-14 14:21:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1512, Invalid=9830, Unknown=0, NotChecked=0, Total=11342 [2022-12-14 14:21:49,182 INFO L87 Difference]: Start difference. First operand 698 states and 982 transitions. Second operand has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:22:21,194 INFO L93 Difference]: Finished difference Result 1631 states and 2281 transitions. [2022-12-14 14:22:21,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-12-14 14:22:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 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 302 [2022-12-14 14:22:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:22:21,198 INFO L225 Difference]: With dead ends: 1631 [2022-12-14 14:22:21,198 INFO L226 Difference]: Without dead ends: 1598 [2022-12-14 14:22:21,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1143 GetRequests, 902 SyntacticMatches, 9 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20741 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=8392, Invalid=46130, Unknown=0, NotChecked=0, Total=54522 [2022-12-14 14:22:21,201 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 17816 mSDsluCounter, 14357 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17816 SdHoareTripleChecker+Valid, 15050 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:22:21,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17816 Valid, 15050 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 14:22:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-12-14 14:22:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1127. [2022-12-14 14:22:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.425399644760213) internal successors, (1605), 1126 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1605 transitions. [2022-12-14 14:22:21,238 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1605 transitions. Word has length 302 [2022-12-14 14:22:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:22:21,238 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1605 transitions. [2022-12-14 14:22:21,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1605 transitions. [2022-12-14 14:22:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-12-14 14:22:21,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:22:21,240 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 21, 21, 14, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:22:21,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 14:22:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 14:22:21,441 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:22:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:22:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 765225555, now seen corresponding path program 3 times [2022-12-14 14:22:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:22:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321924600] [2022-12-14 14:22:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:22:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:22:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:22:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2164 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 14:22:26,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:22:26,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321924600] [2022-12-14 14:22:26,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321924600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:22:26,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889414518] [2022-12-14 14:22:26,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:22:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:22:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:22:26,278 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:22:26,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 14:22:26,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:22:26,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:22:26,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 146 conjunts are in the unsatisfiable core [2022-12-14 14:22:26,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:22:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:22:27,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:22:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:22:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889414518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:22:38,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [828864375] [2022-12-14 14:22:38,930 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 14:22:38,930 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:22:38,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:22:38,930 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:22:38,930 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:22:40,094 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:22:46,103 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33170#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 14:22:46,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:22:46,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:22:46,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31, 46] total 90 [2022-12-14 14:22:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821318534] [2022-12-14 14:22:46,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:22:46,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-12-14 14:22:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:22:46,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-12-14 14:22:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=14202, Unknown=0, NotChecked=0, Total=15006 [2022-12-14 14:22:46,106 INFO L87 Difference]: Start difference. First operand 1127 states and 1605 transitions. Second operand has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:22:52,150 INFO L93 Difference]: Finished difference Result 1251 states and 1738 transitions. [2022-12-14 14:22:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-12-14 14:22:52,151 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 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 308 [2022-12-14 14:22:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:22:52,154 INFO L225 Difference]: With dead ends: 1251 [2022-12-14 14:22:52,154 INFO L226 Difference]: Without dead ends: 1246 [2022-12-14 14:22:52,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 879 SyntacticMatches, 11 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9710 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1682, Invalid=26040, Unknown=0, NotChecked=0, Total=27722 [2022-12-14 14:22:52,156 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 6212 mSDsluCounter, 39559 mSDsCounter, 0 mSdLazyCounter, 4112 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6212 SdHoareTripleChecker+Valid, 40404 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 4112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:22:52,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6212 Valid, 40404 Invalid, 4360 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [248 Valid, 4112 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 14:22:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-12-14 14:22:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1179. [2022-12-14 14:22:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 1.4269949066213923) internal successors, (1681), 1178 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1681 transitions. [2022-12-14 14:22:52,196 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1681 transitions. Word has length 308 [2022-12-14 14:22:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:22:52,196 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1681 transitions. [2022-12-14 14:22:52,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:22:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1681 transitions. [2022-12-14 14:22:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-12-14 14:22:52,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:22:52,198 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:22:52,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 14:22:52,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 14:22:52,400 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:22:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:22:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash -926782826, now seen corresponding path program 1 times [2022-12-14 14:22:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:22:52,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542680685] [2022-12-14 14:22:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:22:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:22:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:22:52,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 14:22:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:22:53,445 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 14:22:53,445 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 14:22:53,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 14:22:53,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 14:22:53,450 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:22:53,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 14:22:53,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:22:53 BoogieIcfgContainer [2022-12-14 14:22:53,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 14:22:53,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 14:22:53,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 14:22:53,560 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 14:22:53,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:19:48" (3/4) ... [2022-12-14 14:22:53,561 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 14:22:53,673 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 14:22:53,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 14:22:53,673 INFO L158 Benchmark]: Toolchain (without parser) took 186318.60ms. Allocated memory was 130.0MB in the beginning and 721.4MB in the end (delta: 591.4MB). Free memory was 97.2MB in the beginning and 499.3MB in the end (delta: -402.1MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,673 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:22:53,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.91ms. Allocated memory is still 130.0MB. Free memory was 96.8MB in the beginning and 78.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 130.0MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,674 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 70.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,674 INFO L158 Benchmark]: RCFGBuilder took 653.71ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 70.6MB in the beginning and 109.1MB in the end (delta: -38.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,674 INFO L158 Benchmark]: TraceAbstraction took 185216.56ms. Allocated memory was 165.7MB in the beginning and 721.4MB in the end (delta: 555.7MB). Free memory was 108.4MB in the beginning and 530.7MB in the end (delta: -422.4MB). Peak memory consumption was 472.4MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,675 INFO L158 Benchmark]: Witness Printer took 113.27ms. Allocated memory is still 721.4MB. Free memory was 530.7MB in the beginning and 499.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-14 14:22:53,676 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.13ms. Allocated memory is still 130.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.91ms. Allocated memory is still 130.0MB. Free memory was 96.8MB in the beginning and 78.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 130.0MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 70.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 653.71ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 70.6MB in the beginning and 109.1MB in the end (delta: -38.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 185216.56ms. Allocated memory was 165.7MB in the beginning and 721.4MB in the end (delta: 555.7MB). Free memory was 108.4MB in the beginning and 530.7MB in the end (delta: -422.4MB). Peak memory consumption was 472.4MB. Max. memory is 16.1GB. * Witness Printer took 113.27ms. Allocated memory is still 721.4MB. Free memory was 530.7MB in the beginning and 499.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 185.1s, OverallIterations: 25, TraceHistogramMax: 35, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37189 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37189 mSDsluCounter, 94191 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87785 mSDsCounter, 2183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11891 IncrementalHoareTripleChecker+Invalid, 14074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2183 mSolverCounterUnsat, 6406 mSDtfsCounter, 11891 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6378 GetRequests, 5068 SyntacticMatches, 111 SemanticMatches, 1199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51727 ImplicationChecksByTransitivity, 100.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=24, InterpolantAutomatonStates: 562, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 4237 NumberOfCodeBlocks, 4237 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 5672 ConstructedInterpolants, 0 QuantifiedInterpolants, 77902 SizeOfPredicates, 68 NumberOfNonLiveVariables, 12538 ConjunctsInSsa, 689 ConjunctsInUnsatCore, 56 InterpolantComputations, 8 PerfectInterpolantSequences, 1825/25873 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 14:22:53,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1635d7-f9ed-4c61-bf89-f14eabafcbf4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE