./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 b5237d83 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_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 01:36:12,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:36:12,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:36:12,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:36:12,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:36:12,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:36:12,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:36:12,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:36:12,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:36:12,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:36:12,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:36:12,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:36:12,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:36:12,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:36:12,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:36:12,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:36:12,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:36:12,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:36:12,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:36:12,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:36:12,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:36:12,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:36:12,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:36:12,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:36:12,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:36:12,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:36:12,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:36:12,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:36:12,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:36:12,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:36:12,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:36:12,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:36:12,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:36:12,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:36:12,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:36:12,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:36:12,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:36:12,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:36:12,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:36:12,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:36:12,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:36:12,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:36:12,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:36:12,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:36:12,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:36:12,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:36:12,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:36:12,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:36:12,473 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:36:12,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:36:12,474 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:36:12,474 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:36:12,475 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:36:12,476 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:36:12,476 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:36:12,476 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:36:12,477 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:36:12,477 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:36:12,477 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:36:12,477 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:36:12,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:36:12,479 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:36:12,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:36:12,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:36:12,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:36:12,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:36:12,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:36:12,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:36:12,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:36:12,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:36:12,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:36:12,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:36:12,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:36:12,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:36:12,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:36:12,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:36:12,483 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:36:12,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:36:12,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:36:12,484 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:36:12,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:36:12,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:36:12,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:36:12,485 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_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/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_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba 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-11-22 01:36:12,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:36:12,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:36:12,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:36:12,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:36:12,896 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:36:12,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-22 01:36:16,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:36:16,804 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:36:16,804 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-22 01:36:16,817 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/data/e075570f7/6d9d947ae0314aa28f63b3ac2fb25250/FLAG4e8f6c826 [2022-11-22 01:36:16,857 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/data/e075570f7/6d9d947ae0314aa28f63b3ac2fb25250 [2022-11-22 01:36:16,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:36:16,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:36:16,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:36:16,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:36:16,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:36:16,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:36:16" (1/1) ... [2022-11-22 01:36:16,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21383ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:16, skipping insertion in model container [2022-11-22 01:36:16,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:36:16" (1/1) ... [2022-11-22 01:36:16,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:36:16,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:36:17,328 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_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-22 01:36:17,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:36:17,365 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:36:17,447 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_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-22 01:36:17,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:36:17,466 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:36:17,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17 WrapperNode [2022-11-22 01:36:17,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:36:17,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:36:17,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:36:17,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:36:17,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,551 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-11-22 01:36:17,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:36:17,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:36:17,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:36:17,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:36:17,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,599 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:36:17,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:36:17,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:36:17,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:36:17,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (1/1) ... [2022-11-22 01:36:17,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:36:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:17,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:36:17,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:36:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:36:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:36:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:36:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:36:17,837 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:36:17,839 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:36:18,956 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:36:19,001 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:36:19,001 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 01:36:19,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:36:19 BoogieIcfgContainer [2022-11-22 01:36:19,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:36:19,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:36:19,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:36:19,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:36:19,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:36:16" (1/3) ... [2022-11-22 01:36:19,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4cc6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:36:19, skipping insertion in model container [2022-11-22 01:36:19,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:36:17" (2/3) ... [2022-11-22 01:36:19,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4cc6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:36:19, skipping insertion in model container [2022-11-22 01:36:19,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:36:19" (3/3) ... [2022-11-22 01:36:19,021 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-11-22 01:36:19,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:36:19,047 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:36:19,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:36:19,132 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;@5fd71611, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:36:19,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:36:19,143 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-11-22 01:36:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:36:19,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:19,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:36:19,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1655152119, now seen corresponding path program 1 times [2022-11-22 01:36:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:19,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310635960] [2022-11-22 01:36:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:19,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310635960] [2022-11-22 01:36:19,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310635960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:19,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:19,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:36:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225344539] [2022-11-22 01:36:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:36:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:36:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:36:19,521 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-11-22 01:36:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:19,581 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2022-11-22 01:36:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:36:19,585 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-11-22 01:36:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:19,601 INFO L225 Difference]: With dead ends: 213 [2022-11-22 01:36:19,602 INFO L226 Difference]: Without dead ends: 104 [2022-11-22 01:36:19,606 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-11-22 01:36:19,611 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-11-22 01:36:19,613 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-11-22 01:36:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-22 01:36:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-22 01:36:19,662 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-11-22 01:36:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 174 transitions. [2022-11-22 01:36:19,667 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 174 transitions. Word has length 8 [2022-11-22 01:36:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:19,668 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 174 transitions. [2022-11-22 01:36:19,668 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-11-22 01:36:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2022-11-22 01:36:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:36:19,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:19,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:36:19,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:36:19,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 762379355, now seen corresponding path program 1 times [2022-11-22 01:36:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:19,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140460146] [2022-11-22 01:36:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:19,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:19,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140460146] [2022-11-22 01:36:19,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140460146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:19,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:19,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:36:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610565299] [2022-11-22 01:36:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:19,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:19,770 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-11-22 01:36:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:19,837 INFO L93 Difference]: Finished difference Result 210 states and 351 transitions. [2022-11-22 01:36:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:19,837 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-11-22 01:36:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:19,839 INFO L225 Difference]: With dead ends: 210 [2022-11-22 01:36:19,839 INFO L226 Difference]: Without dead ends: 107 [2022-11-22 01:36:19,840 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-11-22 01:36:19,842 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-11-22 01:36:19,843 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-11-22 01:36:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-22 01:36:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-22 01:36:19,853 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-11-22 01:36:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 177 transitions. [2022-11-22 01:36:19,855 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 177 transitions. Word has length 9 [2022-11-22 01:36:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:19,856 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 177 transitions. [2022-11-22 01:36:19,856 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-11-22 01:36:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 177 transitions. [2022-11-22 01:36:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:36:19,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:19,858 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:36:19,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:36:19,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -197013714, now seen corresponding path program 1 times [2022-11-22 01:36:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845969277] [2022-11-22 01:36:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:21,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:21,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845969277] [2022-11-22 01:36:21,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845969277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:21,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:21,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:36:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988757117] [2022-11-22 01:36:21,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:21,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:36:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:36:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:36:21,062 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-11-22 01:36:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:21,496 INFO L93 Difference]: Finished difference Result 218 states and 355 transitions. [2022-11-22 01:36:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:36:21,497 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-11-22 01:36:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:21,499 INFO L225 Difference]: With dead ends: 218 [2022-11-22 01:36:21,499 INFO L226 Difference]: Without dead ends: 194 [2022-11-22 01:36:21,500 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-11-22 01:36:21,501 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:36:21,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 519 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:36:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-22 01:36:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-11-22 01:36:21,534 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-11-22 01:36:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 290 transitions. [2022-11-22 01:36:21,540 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 290 transitions. Word has length 14 [2022-11-22 01:36:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:21,541 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 290 transitions. [2022-11-22 01:36:21,541 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-11-22 01:36:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 290 transitions. [2022-11-22 01:36:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:36:21,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:21,544 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:36:21,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:36:21,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 938789430, now seen corresponding path program 1 times [2022-11-22 01:36:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465083492] [2022-11-22 01:36:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:21,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465083492] [2022-11-22 01:36:21,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465083492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:21,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:36:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670795404] [2022-11-22 01:36:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:21,593 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-11-22 01:36:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:21,637 INFO L93 Difference]: Finished difference Result 302 states and 496 transitions. [2022-11-22 01:36:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:21,638 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-11-22 01:36:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:21,640 INFO L225 Difference]: With dead ends: 302 [2022-11-22 01:36:21,640 INFO L226 Difference]: Without dead ends: 128 [2022-11-22 01:36:21,641 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-11-22 01:36:21,643 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-11-22 01:36:21,643 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-11-22 01:36:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-22 01:36:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-22 01:36:21,658 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-11-22 01:36:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 203 transitions. [2022-11-22 01:36:21,664 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 203 transitions. Word has length 15 [2022-11-22 01:36:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:21,665 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 203 transitions. [2022-11-22 01:36:21,665 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-11-22 01:36:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 203 transitions. [2022-11-22 01:36:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:36:21,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:21,667 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:36:21,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:36:21,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1693191315, now seen corresponding path program 1 times [2022-11-22 01:36:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:21,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899195346] [2022-11-22 01:36:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:36:21,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899195346] [2022-11-22 01:36:21,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899195346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:21,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:36:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875190008] [2022-11-22 01:36:21,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:21,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:21,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:21,783 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-11-22 01:36:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:21,835 INFO L93 Difference]: Finished difference Result 257 states and 414 transitions. [2022-11-22 01:36:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:21,836 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-11-22 01:36:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:21,837 INFO L225 Difference]: With dead ends: 257 [2022-11-22 01:36:21,837 INFO L226 Difference]: Without dead ends: 133 [2022-11-22 01:36:21,841 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-11-22 01:36:21,850 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-11-22 01:36:21,851 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-11-22 01:36:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-22 01:36:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-11-22 01:36:21,868 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-11-22 01:36:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 208 transitions. [2022-11-22 01:36:21,870 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 208 transitions. Word has length 20 [2022-11-22 01:36:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:21,871 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 208 transitions. [2022-11-22 01:36:21,871 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-11-22 01:36:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 208 transitions. [2022-11-22 01:36:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:36:21,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:21,875 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-11-22 01:36:21,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:36:21,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1475234708, now seen corresponding path program 1 times [2022-11-22 01:36:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:21,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068484084] [2022-11-22 01:36:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:22,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:22,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068484084] [2022-11-22 01:36:22,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068484084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:36:22,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327116461] [2022-11-22 01:36:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:22,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:36:22,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:36:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:22,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:36:22,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:36:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:22,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:36:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:22,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327116461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:36:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697338548] [2022-11-22 01:36:22,344 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 01:36:22,344 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:36:22,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:36:22,356 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:36:22,357 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:36:24,887 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:36:28,177 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-11-22 01:36:28,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:36:28,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:36:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-22 01:36:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586513788] [2022-11-22 01:36:28,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:36:28,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:36:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:36:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:36:28,181 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-11-22 01:36:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:28,457 INFO L93 Difference]: Finished difference Result 248 states and 393 transitions. [2022-11-22 01:36:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:36:28,458 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-11-22 01:36:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:28,460 INFO L225 Difference]: With dead ends: 248 [2022-11-22 01:36:28,460 INFO L226 Difference]: Without dead ends: 233 [2022-11-22 01:36:28,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:36:28,462 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 316 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:36:28,463 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.3s Time] [2022-11-22 01:36:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-22 01:36:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2022-11-22 01:36:28,479 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-11-22 01:36:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 345 transitions. [2022-11-22 01:36:28,481 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 345 transitions. Word has length 22 [2022-11-22 01:36:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:28,481 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 345 transitions. [2022-11-22 01:36:28,482 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-11-22 01:36:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 345 transitions. [2022-11-22 01:36:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 01:36:28,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:28,483 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-11-22 01:36:28,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:36:28,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:28,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1500920786, now seen corresponding path program 1 times [2022-11-22 01:36:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:28,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570317561] [2022-11-22 01:36:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:29,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570317561] [2022-11-22 01:36:29,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570317561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:36:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181093472] [2022-11-22 01:36:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:29,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:36:29,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:36:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:29,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 01:36:29,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:36:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:29,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:36:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:29,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181093472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:36:29,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682093811] [2022-11-22 01:36:29,541 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-22 01:36:29,542 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:36:29,542 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:36:29,542 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:36:29,543 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:36:31,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:36:34,822 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-11-22 01:36:34,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:36:34,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:36:34,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2022-11-22 01:36:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134109940] [2022-11-22 01:36:34,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:36:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 01:36:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 01:36:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-22 01:36:34,825 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-11-22 01:36:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:35,039 INFO L93 Difference]: Finished difference Result 235 states and 377 transitions. [2022-11-22 01:36:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:36:35,040 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-11-22 01:36:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:35,041 INFO L225 Difference]: With dead ends: 235 [2022-11-22 01:36:35,042 INFO L226 Difference]: Without dead ends: 231 [2022-11-22 01:36:35,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-22 01:36:35,043 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 117 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:36:35,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 723 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:36:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-22 01:36:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-11-22 01:36:35,053 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-11-22 01:36:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 370 transitions. [2022-11-22 01:36:35,055 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 370 transitions. Word has length 23 [2022-11-22 01:36:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:35,055 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 370 transitions. [2022-11-22 01:36:35,056 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-11-22 01:36:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 370 transitions. [2022-11-22 01:36:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 01:36:35,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:35,057 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-11-22 01:36:35,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 01:36:35,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:35,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1554530707, now seen corresponding path program 1 times [2022-11-22 01:36:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:35,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950100851] [2022-11-22 01:36:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:36:35,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:35,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950100851] [2022-11-22 01:36:35,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950100851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:35,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:35,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:36:35,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790890218] [2022-11-22 01:36:35,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:35,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:35,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:35,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-11-22 01:36:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:35,380 INFO L93 Difference]: Finished difference Result 428 states and 688 transitions. [2022-11-22 01:36:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:35,381 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-11-22 01:36:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:35,383 INFO L225 Difference]: With dead ends: 428 [2022-11-22 01:36:35,383 INFO L226 Difference]: Without dead ends: 201 [2022-11-22 01:36:35,385 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-11-22 01:36:35,387 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-11-22 01:36:35,387 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-11-22 01:36:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-22 01:36:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2022-11-22 01:36:35,398 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-11-22 01:36:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 311 transitions. [2022-11-22 01:36:35,399 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 311 transitions. Word has length 29 [2022-11-22 01:36:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:35,402 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 311 transitions. [2022-11-22 01:36:35,402 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-11-22 01:36:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 311 transitions. [2022-11-22 01:36:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:36:35,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:35,405 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-11-22 01:36:35,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:36:35,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2135712591, now seen corresponding path program 1 times [2022-11-22 01:36:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:35,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991583864] [2022-11-22 01:36:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:36:35,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:35,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991583864] [2022-11-22 01:36:35,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991583864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:36:35,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966351741] [2022-11-22 01:36:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:35,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:36:35,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:36:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:36,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 01:36:36,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:36:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:36:36,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:36:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:36:36,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966351741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:36:36,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861984538] [2022-11-22 01:36:36,503 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-22 01:36:36,504 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:36:36,505 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:36:36,506 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:36:36,506 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:36:38,331 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:36:42,850 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-11-22 01:36:42,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:36:42,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:36:42,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-11-22 01:36:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020640936] [2022-11-22 01:36:42,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:36:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:36:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:36:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-11-22 01:36:42,854 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-11-22 01:36:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:43,899 INFO L93 Difference]: Finished difference Result 596 states and 919 transitions. [2022-11-22 01:36:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:36:43,900 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-11-22 01:36:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:43,902 INFO L225 Difference]: With dead ends: 596 [2022-11-22 01:36:43,903 INFO L226 Difference]: Without dead ends: 415 [2022-11-22 01:36:43,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 01:36:43,905 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 646 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:36:43,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1016 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:36:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-22 01:36:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 349. [2022-11-22 01:36:43,921 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-11-22 01:36:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 550 transitions. [2022-11-22 01:36:43,926 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 550 transitions. Word has length 32 [2022-11-22 01:36:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:43,927 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 550 transitions. [2022-11-22 01:36:43,927 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-11-22 01:36:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 550 transitions. [2022-11-22 01:36:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:36:43,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:43,938 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-11-22 01:36:43,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:36:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:44,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1771134383, now seen corresponding path program 1 times [2022-11-22 01:36:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720909481] [2022-11-22 01:36:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:36:44,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720909481] [2022-11-22 01:36:44,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720909481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:36:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874495643] [2022-11-22 01:36:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:44,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:44,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:36:44,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:36:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:44,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 01:36:44,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:36:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:36:44,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:36:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:36:44,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874495643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:36:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334033353] [2022-11-22 01:36:44,548 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 01:36:44,548 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:36:44,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:36:44,549 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:36:44,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:36:46,249 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:36:50,405 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-11-22 01:36:50,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:36:50,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:36:50,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-22 01:36:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915653025] [2022-11-22 01:36:50,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:36:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:36:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:36:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-11-22 01:36:50,408 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-11-22 01:36:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:50,577 INFO L93 Difference]: Finished difference Result 363 states and 562 transitions. [2022-11-22 01:36:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:36:50,577 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-11-22 01:36:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:50,579 INFO L225 Difference]: With dead ends: 363 [2022-11-22 01:36:50,579 INFO L226 Difference]: Without dead ends: 351 [2022-11-22 01:36:50,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-11-22 01:36:50,581 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 220 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-22 01:36:50,581 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-11-22 01:36:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-22 01:36:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-11-22 01:36:50,594 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-11-22 01:36:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 534 transitions. [2022-11-22 01:36:50,596 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 534 transitions. Word has length 33 [2022-11-22 01:36:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:50,597 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 534 transitions. [2022-11-22 01:36:50,597 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-11-22 01:36:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 534 transitions. [2022-11-22 01:36:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 01:36:50,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:50,599 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-11-22 01:36:50,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:36:50,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:36:50,807 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -886789566, now seen corresponding path program 1 times [2022-11-22 01:36:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:50,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606731801] [2022-11-22 01:36:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:51,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:51,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606731801] [2022-11-22 01:36:51,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606731801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:36:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867886005] [2022-11-22 01:36:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:51,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:36:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:36:51,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:36:51,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:36:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:51,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:36:51,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:36:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:51,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:36:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:36:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867886005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:36:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925445391] [2022-11-22 01:36:52,309 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 01:36:52,309 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:36:52,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:36:52,310 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:36:52,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:36:54,019 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:36:59,108 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-11-22 01:36:59,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:36:59,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:36:59,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2022-11-22 01:36:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941879428] [2022-11-22 01:36:59,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:36:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:36:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:36:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 01:36:59,111 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-11-22 01:36:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:59,384 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2022-11-22 01:36:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:36:59,384 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-11-22 01:36:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:59,387 INFO L225 Difference]: With dead ends: 376 [2022-11-22 01:36:59,387 INFO L226 Difference]: Without dead ends: 374 [2022-11-22 01:36:59,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 01:36:59,388 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 126 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:36:59,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 905 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:36:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-22 01:36:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 349. [2022-11-22 01:36:59,402 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-11-22 01:36:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 533 transitions. [2022-11-22 01:36:59,403 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 533 transitions. Word has length 35 [2022-11-22 01:36:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:59,404 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 533 transitions. [2022-11-22 01:36:59,404 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-11-22 01:36:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 533 transitions. [2022-11-22 01:36:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:36:59,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:59,405 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-11-22 01:36:59,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:36:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 01:36:59,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1595435041, now seen corresponding path program 1 times [2022-11-22 01:36:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:59,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047482204] [2022-11-22 01:36:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:36:59,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047482204] [2022-11-22 01:36:59,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047482204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:59,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:59,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:36:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580781541] [2022-11-22 01:36:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:59,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:59,662 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-11-22 01:36:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:59,709 INFO L93 Difference]: Finished difference Result 669 states and 1016 transitions. [2022-11-22 01:36:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:59,710 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-11-22 01:36:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:59,712 INFO L225 Difference]: With dead ends: 669 [2022-11-22 01:36:59,712 INFO L226 Difference]: Without dead ends: 361 [2022-11-22 01:36:59,713 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-11-22 01:36:59,714 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-11-22 01:36:59,714 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-11-22 01:36:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-22 01:36:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2022-11-22 01:36:59,728 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-11-22 01:36:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2022-11-22 01:36:59,731 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 36 [2022-11-22 01:36:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:59,732 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2022-11-22 01:36:59,732 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-11-22 01:36:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2022-11-22 01:36:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 01:36:59,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:59,734 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-11-22 01:36:59,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:36:59,735 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash 852693590, now seen corresponding path program 1 times [2022-11-22 01:36:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:59,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12092939] [2022-11-22 01:36:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:36:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 01:36:59,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:36:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12092939] [2022-11-22 01:36:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12092939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:36:59,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:36:59,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:36:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294297130] [2022-11-22 01:36:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:36:59,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:36:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:36:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:36:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:36:59,811 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-11-22 01:36:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:36:59,853 INFO L93 Difference]: Finished difference Result 463 states and 685 transitions. [2022-11-22 01:36:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:36:59,854 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-11-22 01:36:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:36:59,857 INFO L225 Difference]: With dead ends: 463 [2022-11-22 01:36:59,857 INFO L226 Difference]: Without dead ends: 219 [2022-11-22 01:36:59,858 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-11-22 01:36:59,860 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-11-22 01:36:59,861 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-11-22 01:36:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-22 01:36:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-11-22 01:36:59,871 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-11-22 01:36:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 313 transitions. [2022-11-22 01:36:59,872 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 313 transitions. Word has length 47 [2022-11-22 01:36:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:36:59,874 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 313 transitions. [2022-11-22 01:36:59,874 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-11-22 01:36:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 313 transitions. [2022-11-22 01:36:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 01:36:59,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:36:59,875 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-11-22 01:36:59,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:36:59,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:36:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:36:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1301360374, now seen corresponding path program 1 times [2022-11-22 01:36:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:36:59,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921674006] [2022-11-22 01:36:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:36:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:36:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:00,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921674006] [2022-11-22 01:37:00,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921674006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308975667] [2022-11-22 01:37:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:00,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:00,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:37:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:00,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:37:00,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:00,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:37:01,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308975667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447493928] [2022-11-22 01:37:01,465 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-22 01:37:01,466 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:01,466 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:01,466 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:01,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:03,354 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:09,339 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-11-22 01:37:09,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:09,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:09,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 12 [2022-11-22 01:37:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179789610] [2022-11-22 01:37:09,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:09,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:37:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:37:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 01:37:09,342 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-11-22 01:37:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:09,948 INFO L93 Difference]: Finished difference Result 322 states and 450 transitions. [2022-11-22 01:37:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:37:09,949 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-11-22 01:37:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:09,950 INFO L225 Difference]: With dead ends: 322 [2022-11-22 01:37:09,950 INFO L226 Difference]: Without dead ends: 315 [2022-11-22 01:37:09,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=301, Invalid=2051, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 01:37:09,952 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 832 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:09,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 892 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:37:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-22 01:37:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 272. [2022-11-22 01:37:09,965 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-11-22 01:37:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 394 transitions. [2022-11-22 01:37:09,966 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 394 transitions. Word has length 49 [2022-11-22 01:37:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:09,967 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 394 transitions. [2022-11-22 01:37:09,967 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-11-22 01:37:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2022-11-22 01:37:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 01:37:09,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:09,969 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-11-22 01:37:09,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:10,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:10,177 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1676014596, now seen corresponding path program 1 times [2022-11-22 01:37:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:10,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237871159] [2022-11-22 01:37:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:10,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:10,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237871159] [2022-11-22 01:37:10,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237871159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:10,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33091295] [2022-11-22 01:37:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:10,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:11,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:37:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:11,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:37:11,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:11,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:12,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33091295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:12,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928232000] [2022-11-22 01:37:12,024 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:37:12,025 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:12,025 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:12,025 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:12,026 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:13,513 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:19,673 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-11-22 01:37:19,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:19,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:19,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-11-22 01:37:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202656853] [2022-11-22 01:37:19,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:19,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:37:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:37:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2022-11-22 01:37:19,676 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-11-22 01:37:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:19,992 INFO L93 Difference]: Finished difference Result 281 states and 399 transitions. [2022-11-22 01:37:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:37:19,993 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-11-22 01:37:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:19,995 INFO L225 Difference]: With dead ends: 281 [2022-11-22 01:37:19,995 INFO L226 Difference]: Without dead ends: 278 [2022-11-22 01:37:19,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=250, Invalid=1912, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 01:37:19,996 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 233 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:19,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 943 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:37:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-22 01:37:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2022-11-22 01:37:20,019 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-11-22 01:37:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 390 transitions. [2022-11-22 01:37:20,020 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 390 transitions. Word has length 50 [2022-11-22 01:37:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:20,021 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 390 transitions. [2022-11-22 01:37:20,021 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-11-22 01:37:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 390 transitions. [2022-11-22 01:37:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-22 01:37:20,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:20,022 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-11-22 01:37:20,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:20,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 01:37:20,237 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1374353121, now seen corresponding path program 1 times [2022-11-22 01:37:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:20,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820344337] [2022-11-22 01:37:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:21,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:21,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820344337] [2022-11-22 01:37:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820344337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076124950] [2022-11-22 01:37:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:21,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:21,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:37:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:21,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 01:37:21,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:21,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:22,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076124950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475185252] [2022-11-22 01:37:22,458 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:37:22,458 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:22,459 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:22,459 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:22,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:24,751 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:30,569 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-11-22 01:37:30,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:30,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 17 [2022-11-22 01:37:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909401745] [2022-11-22 01:37:30,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 01:37:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 01:37:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2188, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 01:37:30,573 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-11-22 01:37:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:30,898 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2022-11-22 01:37:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:37:30,899 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-11-22 01:37:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:30,900 INFO L225 Difference]: With dead ends: 282 [2022-11-22 01:37:30,900 INFO L226 Difference]: Without dead ends: 279 [2022-11-22 01:37:30,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2022-11-22 01:37:30,902 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 285 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:30,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1216 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:37:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-22 01:37:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-11-22 01:37:30,915 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-11-22 01:37:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 387 transitions. [2022-11-22 01:37:30,917 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 387 transitions. Word has length 56 [2022-11-22 01:37:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:30,917 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 387 transitions. [2022-11-22 01:37:30,918 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-11-22 01:37:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 387 transitions. [2022-11-22 01:37:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-22 01:37:30,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:30,919 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-11-22 01:37:30,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:31,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 01:37:31,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash 806051951, now seen corresponding path program 1 times [2022-11-22 01:37:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:31,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220500580] [2022-11-22 01:37:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 01:37:32,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220500580] [2022-11-22 01:37:32,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220500580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97336151] [2022-11-22 01:37:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:32,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:32,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:37:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:32,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 01:37:32,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:33,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97336151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1421598855] [2022-11-22 01:37:34,090 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:37:34,091 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:34,091 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:34,091 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:34,091 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:36,252 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:42,288 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-11-22 01:37:42,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:42,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:42,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-11-22 01:37:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459190258] [2022-11-22 01:37:42,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:42,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 01:37:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 01:37:42,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2688, Unknown=0, NotChecked=0, Total=2970 [2022-11-22 01:37:42,292 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-11-22 01:37:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:42,778 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2022-11-22 01:37:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:37:42,779 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-11-22 01:37:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:42,780 INFO L225 Difference]: With dead ends: 299 [2022-11-22 01:37:42,780 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:37:42,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2022-11-22 01:37:42,782 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 356 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:42,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2300 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:37:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:37:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-11-22 01:37:42,796 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-11-22 01:37:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2022-11-22 01:37:42,797 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 77 [2022-11-22 01:37:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:42,798 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2022-11-22 01:37:42,798 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-11-22 01:37:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2022-11-22 01:37:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-22 01:37:42,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:42,800 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-11-22 01:37:42,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:43,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 01:37:43,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1627393088, now seen corresponding path program 1 times [2022-11-22 01:37:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:43,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454191685] [2022-11-22 01:37:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 01:37:44,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454191685] [2022-11-22 01:37:44,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454191685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408209640] [2022-11-22 01:37:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:44,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:44,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:44,859 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:44,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:37:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:45,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:37:45,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 01:37:45,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:37:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 28 proven. 330 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:37:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408209640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:37:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1562711635] [2022-11-22 01:37:47,786 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-22 01:37:47,786 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:37:47,787 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:37:47,787 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:37:47,787 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:37:49,823 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:37:55,416 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-11-22 01:37:55,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:37:55,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:37:55,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 16] total 23 [2022-11-22 01:37:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311535031] [2022-11-22 01:37:55,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:37:55,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 01:37:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:37:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 01:37:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2852, Unknown=0, NotChecked=0, Total=3192 [2022-11-22 01:37:55,420 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-11-22 01:37:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:37:56,506 INFO L93 Difference]: Finished difference Result 605 states and 858 transitions. [2022-11-22 01:37:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 01:37:56,507 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-11-22 01:37:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:37:56,510 INFO L225 Difference]: With dead ends: 605 [2022-11-22 01:37:56,510 INFO L226 Difference]: Without dead ends: 587 [2022-11-22 01:37:56,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 357 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2022-11-22 01:37:56,512 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 2409 mSDsluCounter, 2812 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:37:56,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 3127 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:37:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-22 01:37:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 550. [2022-11-22 01:37:56,544 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-11-22 01:37:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 797 transitions. [2022-11-22 01:37:56,547 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 797 transitions. Word has length 130 [2022-11-22 01:37:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:37:56,548 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 797 transitions. [2022-11-22 01:37:56,548 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-11-22 01:37:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 797 transitions. [2022-11-22 01:37:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-22 01:37:56,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:37:56,550 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-11-22 01:37:56,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:37:56,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:56,764 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:37:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:37:56,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1630818142, now seen corresponding path program 1 times [2022-11-22 01:37:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:37:56,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391614220] [2022-11-22 01:37:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:37:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 335 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 01:37:58,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:37:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391614220] [2022-11-22 01:37:58,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391614220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:37:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997612791] [2022-11-22 01:37:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:37:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:37:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:37:58,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:37:58,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:37:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:37:59,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-22 01:37:59,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:37:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:37:59,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:01,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997612791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [518953568] [2022-11-22 01:38:01,826 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:38:01,826 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:01,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:01,827 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:01,827 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:03,686 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:09,959 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-11-22 01:38:09,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:09,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:09,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 33 [2022-11-22 01:38:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771905142] [2022-11-22 01:38:09,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:09,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:38:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:09,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:38:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3959, Unknown=0, NotChecked=0, Total=4290 [2022-11-22 01:38:09,964 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-11-22 01:38:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:11,237 INFO L93 Difference]: Finished difference Result 578 states and 817 transitions. [2022-11-22 01:38:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 01:38:11,238 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-11-22 01:38:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:11,240 INFO L225 Difference]: With dead ends: 578 [2022-11-22 01:38:11,240 INFO L226 Difference]: Without dead ends: 564 [2022-11-22 01:38:11,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=414, Invalid=5286, Unknown=0, NotChecked=0, Total=5700 [2022-11-22 01:38:11,243 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 1029 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:11,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 5661 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:38:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-22 01:38:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 550. [2022-11-22 01:38:11,269 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-11-22 01:38:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 778 transitions. [2022-11-22 01:38:11,271 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 778 transitions. Word has length 134 [2022-11-22 01:38:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:11,272 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 778 transitions. [2022-11-22 01:38:11,272 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-11-22 01:38:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 778 transitions. [2022-11-22 01:38:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-22 01:38:11,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:11,274 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-11-22 01:38:11,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:11,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:11,482 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1759770873, now seen corresponding path program 2 times [2022-11-22 01:38:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981023267] [2022-11-22 01:38:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 382 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 01:38:14,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981023267] [2022-11-22 01:38:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981023267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118112805] [2022-11-22 01:38:14,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:38:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:14,647 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:14,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:38:14,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-22 01:38:14,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:38:14,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 01:38:14,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 01:38:15,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 85 proven. 323 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 01:38:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118112805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [217554436] [2022-11-22 01:38:16,715 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:38:16,715 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:16,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:16,715 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:16,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:18,405 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:23,843 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-11-22 01:38:23,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:23,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:23,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 28 [2022-11-22 01:38:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371272043] [2022-11-22 01:38:23,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:23,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 01:38:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 01:38:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3275, Unknown=0, NotChecked=0, Total=3660 [2022-11-22 01:38:23,847 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-11-22 01:38:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:27,290 INFO L93 Difference]: Finished difference Result 819 states and 1129 transitions. [2022-11-22 01:38:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-22 01:38:27,290 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-11-22 01:38:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:27,295 INFO L225 Difference]: With dead ends: 819 [2022-11-22 01:38:27,295 INFO L226 Difference]: Without dead ends: 817 [2022-11-22 01:38:27,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1574, Invalid=11766, Unknown=0, NotChecked=0, Total=13340 [2022-11-22 01:38:27,298 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 1881 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:27,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 4289 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:38:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-22 01:38:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 551. [2022-11-22 01:38:27,327 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-11-22 01:38:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 776 transitions. [2022-11-22 01:38:27,329 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 776 transitions. Word has length 140 [2022-11-22 01:38:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:27,329 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 776 transitions. [2022-11-22 01:38:27,329 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-11-22 01:38:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 776 transitions. [2022-11-22 01:38:27,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-22 01:38:27,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:27,332 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-11-22 01:38:27,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:27,539 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 385745929, now seen corresponding path program 2 times [2022-11-22 01:38:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098239999] [2022-11-22 01:38:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-22 01:38:30,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098239999] [2022-11-22 01:38:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098239999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814870375] [2022-11-22 01:38:30,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:38:30,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:30,201 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:30,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 01:38:30,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-22 01:38:30,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:38:30,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 01:38:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-22 01:38:31,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 54 proven. 521 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:38:34,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814870375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:38:34,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591718556] [2022-11-22 01:38:34,877 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:38:34,877 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:38:34,878 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:38:34,878 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:38:34,878 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:38:36,621 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:38:42,016 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-11-22 01:38:42,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:38:42,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:38:42,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 20] total 30 [2022-11-22 01:38:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201029239] [2022-11-22 01:38:42,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:38:42,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 01:38:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 01:38:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3449, Unknown=0, NotChecked=0, Total=3906 [2022-11-22 01:38:42,018 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-11-22 01:38:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:46,413 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2022-11-22 01:38:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-22 01:38:46,414 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-11-22 01:38:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:46,419 INFO L225 Difference]: With dead ends: 712 [2022-11-22 01:38:46,419 INFO L226 Difference]: Without dead ends: 702 [2022-11-22 01:38:46,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 461 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3696 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1521, Invalid=9399, Unknown=0, NotChecked=0, Total=10920 [2022-11-22 01:38:46,422 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 4145 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4145 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:46,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4145 Valid, 5286 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:38:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-22 01:38:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 662. [2022-11-22 01:38:46,453 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-11-22 01:38:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 933 transitions. [2022-11-22 01:38:46,455 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 933 transitions. Word has length 161 [2022-11-22 01:38:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:46,456 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 933 transitions. [2022-11-22 01:38:46,456 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-11-22 01:38:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 933 transitions. [2022-11-22 01:38:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-11-22 01:38:46,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:46,461 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-11-22 01:38:46,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:46,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:46,673 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 473554572, now seen corresponding path program 2 times [2022-11-22 01:38:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:46,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500537524] [2022-11-22 01:38:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-22 01:38:56,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500537524] [2022-11-22 01:38:56,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500537524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365093301] [2022-11-22 01:38:56,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:38:56,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:56,926 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:56,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 01:38:57,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-11-22 01:38:57,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:38:57,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-22 01:38:57,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:38:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-22 01:38:58,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2024 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-22 01:39:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365093301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045497600] [2022-11-22 01:39:00,205 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-22 01:39:00,205 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:39:00,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:39:00,206 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:39:00,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:39:01,804 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:39:08,029 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-11-22 01:39:08,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:39:08,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 34] total 56 [2022-11-22 01:39:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791340657] [2022-11-22 01:39:08,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:08,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-22 01:39:08,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:08,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-22 01:39:08,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=6883, Unknown=0, NotChecked=0, Total=8010 [2022-11-22 01:39:08,036 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-11-22 01:39:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:09,956 INFO L93 Difference]: Finished difference Result 784 states and 1087 transitions. [2022-11-22 01:39:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 01:39:09,959 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-11-22 01:39:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:09,963 INFO L225 Difference]: With dead ends: 784 [2022-11-22 01:39:09,963 INFO L226 Difference]: Without dead ends: 775 [2022-11-22 01:39:09,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 842 SyntacticMatches, 22 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4591 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1667, Invalid=10105, Unknown=0, NotChecked=0, Total=11772 [2022-11-22 01:39:09,965 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 3104 mSDsluCounter, 8196 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3104 SdHoareTripleChecker+Valid, 8874 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:09,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3104 Valid, 8874 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:39:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-22 01:39:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 698. [2022-11-22 01:39:10,001 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-11-22 01:39:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 982 transitions. [2022-11-22 01:39:10,003 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 982 transitions. Word has length 298 [2022-11-22 01:39:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:10,004 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 982 transitions. [2022-11-22 01:39:10,005 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-11-22 01:39:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 982 transitions. [2022-11-22 01:39:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-11-22 01:39:10,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:10,010 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-11-22 01:39:10,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:10,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 01:39:10,219 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:39:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1459913490, now seen corresponding path program 2 times [2022-11-22 01:39:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217137445] [2022-11-22 01:39:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2059 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-22 01:39:15,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:15,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217137445] [2022-11-22 01:39:15,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217137445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:15,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032541706] [2022-11-22 01:39:15,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:39:15,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:15,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:15,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 01:39:16,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-11-22 01:39:16,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:39:16,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-22 01:39:16,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2075 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-22 01:39:17,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 203 proven. 1958 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:39:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032541706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:31,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [476264164] [2022-11-22 01:39:31,875 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:39:31,876 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:39:31,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:39:31,876 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:39:31,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:39:33,519 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:39:41,223 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-11-22 01:39:41,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:39:41,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:41,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 43] total 74 [2022-11-22 01:39:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199297960] [2022-11-22 01:39:41,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:41,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-22 01:39:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-22 01:39:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=9906, Unknown=0, NotChecked=0, Total=11342 [2022-11-22 01:39:41,228 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-11-22 01:40:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:27,448 INFO L93 Difference]: Finished difference Result 1631 states and 2281 transitions. [2022-11-22 01:40:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-11-22 01:40:27,448 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-11-22 01:40:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:27,453 INFO L225 Difference]: With dead ends: 1631 [2022-11-22 01:40:27,454 INFO L226 Difference]: Without dead ends: 1598 [2022-11-22 01:40:27,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1143 GetRequests, 902 SyntacticMatches, 9 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20621 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=8252, Invalid=46270, Unknown=0, NotChecked=0, Total=54522 [2022-11-22 01:40:27,459 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 23477 mSDsluCounter, 14357 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 2443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23477 SdHoareTripleChecker+Valid, 15050 SdHoareTripleChecker+Invalid, 4500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2443 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:27,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23477 Valid, 15050 Invalid, 4500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2443 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-22 01:40:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-11-22 01:40:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1127. [2022-11-22 01:40:27,523 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-11-22 01:40:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1605 transitions. [2022-11-22 01:40:27,526 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1605 transitions. Word has length 302 [2022-11-22 01:40:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:27,527 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1605 transitions. [2022-11-22 01:40:27,527 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-11-22 01:40:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1605 transitions. [2022-11-22 01:40:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-22 01:40:27,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:27,532 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-11-22 01:40:27,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:27,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 01:40:27,741 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:40:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 765225555, now seen corresponding path program 3 times [2022-11-22 01:40:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823976978] [2022-11-22 01:40:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2164 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-22 01:40:34,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823976978] [2022-11-22 01:40:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823976978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802048866] [2022-11-22 01:40:34,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:40:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:34,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:34,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 01:40:34,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:40:34,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:40:34,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-22 01:40:34,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:36,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:53,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802048866] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:53,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [583404417] [2022-11-22 01:40:53,389 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 01:40:53,389 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:53,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:53,390 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:53,390 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:55,054 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:41:04,065 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-11-22 01:41:04,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:41:04,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:04,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31, 46] total 90 [2022-11-22 01:41:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876750447] [2022-11-22 01:41:04,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:04,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-22 01:41:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-22 01:41:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=14220, Unknown=0, NotChecked=0, Total=15006 [2022-11-22 01:41:04,071 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-11-22 01:41:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:13,689 INFO L93 Difference]: Finished difference Result 1251 states and 1738 transitions. [2022-11-22 01:41:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-22 01:41:13,690 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-11-22 01:41:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:13,694 INFO L225 Difference]: With dead ends: 1251 [2022-11-22 01:41:13,694 INFO L226 Difference]: Without dead ends: 1246 [2022-11-22 01:41:13,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 879 SyntacticMatches, 11 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9696 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=1650, Invalid=26072, Unknown=0, NotChecked=0, Total=27722 [2022-11-22 01:41:13,697 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 7352 mSDsluCounter, 39559 mSDsCounter, 0 mSdLazyCounter, 4112 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7352 SdHoareTripleChecker+Valid, 40404 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:13,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7352 Valid, 40404 Invalid, 4679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [567 Valid, 4112 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-22 01:41:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-22 01:41:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1179. [2022-11-22 01:41:13,765 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-11-22 01:41:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1681 transitions. [2022-11-22 01:41:13,767 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1681 transitions. Word has length 308 [2022-11-22 01:41:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:13,768 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1681 transitions. [2022-11-22 01:41:13,768 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-11-22 01:41:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1681 transitions. [2022-11-22 01:41:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-11-22 01:41:13,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:13,771 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-11-22 01:41:13,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 01:41:13,980 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:41:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -926782826, now seen corresponding path program 1 times [2022-11-22 01:41:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400711947] [2022-11-22 01:41:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:41:14,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:41:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:41:15,725 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:41:15,726 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:41:15,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 01:41:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 01:41:15,732 INFO L444 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-11-22 01:41:15,737 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:41:15,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:41:15 BoogieIcfgContainer [2022-11-22 01:41:15,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:41:15,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:41:15,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:41:15,970 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:41:15,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:36:19" (3/4) ... [2022-11-22 01:41:15,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:41:16,208 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:41:16,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:41:16,209 INFO L158 Benchmark]: Toolchain (without parser) took 299342.74ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 120.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 203.6MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,209 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 153.1MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:41:16,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.08ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 101.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.41ms. Allocated memory is still 153.1MB. Free memory was 101.3MB in the beginning and 97.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,210 INFO L158 Benchmark]: Boogie Preprocessor took 57.12ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,210 INFO L158 Benchmark]: RCFGBuilder took 1395.19ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 94.0MB in the beginning and 185.7MB in the end (delta: -91.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,211 INFO L158 Benchmark]: TraceAbstraction took 296960.11ms. Allocated memory was 222.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 184.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 894.6MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,211 INFO L158 Benchmark]: Witness Printer took 238.32ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-22 01:41:16,213 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.33ms. Allocated memory is still 153.1MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.08ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 101.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.41ms. Allocated memory is still 153.1MB. Free memory was 101.3MB in the beginning and 97.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.12ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1395.19ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 94.0MB in the beginning and 185.7MB in the end (delta: -91.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * TraceAbstraction took 296960.11ms. Allocated memory was 222.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 184.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 894.6MB. Max. memory is 16.1GB. * Witness Printer took 238.32ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. 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: 296.6s, OverallIterations: 25, TraceHistogramMax: 35, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 72.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46881 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46881 mSDsluCounter, 94191 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87785 mSDsCounter, 4452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11891 IncrementalHoareTripleChecker+Invalid, 16343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4452 mSolverCounterUnsat, 6406 mSDtfsCounter, 11891 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6378 GetRequests, 5068 SyntacticMatches, 111 SemanticMatches, 1199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51409 ImplicationChecksByTransitivity, 161.6s 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 91.1s 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-11-22 01:41:16,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d33d2992-f72e-48ed-a7d6-ce99ecedb3f0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE