./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 a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:26:48,872 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:26:48,987 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 17:26:48,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:26:48,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:26:49,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:26:49,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:26:49,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:26:49,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:26:49,055 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:26:49,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:26:49,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:26:49,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:26:49,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:26:49,061 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:26:49,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:26:49,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:26:49,062 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:26:49,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:26:49,063 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:26:49,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:26:49,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:26:49,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:26:49,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:26:49,069 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:26:49,070 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:26:49,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:26:49,070 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:26:49,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:26:49,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:26:49,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:26:49,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:26:49,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:26:49,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:26:49,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:26:49,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:26:49,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:26:49,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:26:49,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:26:49,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:26:49,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:26:49,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:26:49,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/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_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> Automizer
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
[2024-11-08 17:26:49,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:26:49,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:26:49,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:26:49,486 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:26:49,487 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:26:49,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c
Unable to find full path for "g++"
[2024-11-08 17:26:52,011 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:26:52,359 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:26:52,362 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/sv-benchmarks/c/psyco/psyco_abp_1-1.c
[2024-11-08 17:26:52,379 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/data/6a4c2748b/be255c1965914755a78c745429adfc04/FLAG760826e22
[2024-11-08 17:26:52,396 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/data/6a4c2748b/be255c1965914755a78c745429adfc04
[2024-11-08 17:26:52,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:26:52,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:26:52,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:26:52,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:26:52,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:26:52,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:26:52" (1/1) ...
[2024-11-08 17:26:52,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a526a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:52, skipping insertion in model container
[2024-11-08 17:26:52,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:26:52" (1/1) ...
[2024-11-08 17:26:52,472 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:26:52,968 WARN L250 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_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831]
[2024-11-08 17:26:52,978 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:26:52,992 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:26:53,088 WARN L250 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_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831]
[2024-11-08 17:26:53,091 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:26:53,115 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:26:53,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53 WrapperNode
[2024-11-08 17:26:53,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:26:53,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:26:53,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:26:53,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:26:53,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,225 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457
[2024-11-08 17:26:53,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:26:53,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:26:53,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:26:53,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:26:53,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 17:26:53,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:26:53,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:26:53,357 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:26:53,358 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:26:53,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (1/1) ...
[2024-11-08 17:26:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:26:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:26:53,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:26:53,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:26:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:26:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:26:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:26:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:26:53,558 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:26:53,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:26:54,811 INFO L? ?]: Removed 289 outVars from TransFormulas that were not future-live.
[2024-11-08 17:26:54,812 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:26:54,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:26:54,837 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-08 17:26:54,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:26:54 BoogieIcfgContainer
[2024-11-08 17:26:54,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:26:54,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:26:54,842 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:26:54,847 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:26:54,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:26:52" (1/3) ...
[2024-11-08 17:26:54,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7023f94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:26:54, skipping insertion in model container
[2024-11-08 17:26:54,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:26:53" (2/3) ...
[2024-11-08 17:26:54,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7023f94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:26:54, skipping insertion in model container
[2024-11-08 17:26:54,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:26:54" (3/3) ...
[2024-11-08 17:26:54,851 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c
[2024-11-08 17:26:54,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:26:54,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:26:54,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:26:54,973 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@575585b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:26:54,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:26:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-08 17:26:54,988 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:54,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:54,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times
[2024-11-08 17:26:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126991939]
[2024-11-08 17:26:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:55,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126991939]
[2024-11-08 17:26:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126991939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:55,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:26:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303007031]
[2024-11-08 17:26:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:26:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:26:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:26:55,345 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:55,397 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions.
[2024-11-08 17:26:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:26:55,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-08 17:26:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:55,418 INFO L225 Difference]: With dead ends: 218
[2024-11-08 17:26:55,418 INFO L226 Difference]: Without dead ends: 106
[2024-11-08 17:26:55,423 INFO L431 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
[2024-11-08 17:26:55,429 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:55,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:26:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-08 17:26:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2024-11-08 17:26:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 105 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)
[2024-11-08 17:26:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions.
[2024-11-08 17:26:55,498 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10
[2024-11-08 17:26:55,499 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:55,503 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions.
[2024-11-08 17:26:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions.
[2024-11-08 17:26:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-08 17:26:55,505 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:55,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:55,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:26:55,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times
[2024-11-08 17:26:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708812964]
[2024-11-08 17:26:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708812964]
[2024-11-08 17:26:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708812964] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:26:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661237556]
[2024-11-08 17:26:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:55,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:26:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:26:55,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:26:55,682 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:55,767 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions.
[2024-11-08 17:26:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:26:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11
[2024-11-08 17:26:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:55,770 INFO L225 Difference]: With dead ends: 214
[2024-11-08 17:26:55,771 INFO L226 Difference]: Without dead ends: 110
[2024-11-08 17:26:55,772 INFO L431 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
[2024-11-08 17:26:55,773 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:55,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:26:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2024-11-08 17:26:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2024-11-08 17:26:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 109 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions.
[2024-11-08 17:26:55,788 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11
[2024-11-08 17:26:55,789 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:55,789 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions.
[2024-11-08 17:26:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions.
[2024-11-08 17:26:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-08 17:26:55,791 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:55,791 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:26:55,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times
[2024-11-08 17:26:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731403159]
[2024-11-08 17:26:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731403159]
[2024-11-08 17:26:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731403159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:26:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704215844]
[2024-11-08 17:26:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:26:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:26:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:26:56,439 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:56,920 INFO L93 Difference]: Finished difference Result 322 states and 539 transitions.
[2024-11-08 17:26:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:26:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17
[2024-11-08 17:26:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:56,924 INFO L225 Difference]: With dead ends: 322
[2024-11-08 17:26:56,928 INFO L226 Difference]: Without dead ends: 193
[2024-11-08 17:26:56,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:26:56,930 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 132 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:56,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 387 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 17:26:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2024-11-08 17:26:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184.
[2024-11-08 17:26:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.644808743169399) internal successors, (301), 183 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions.
[2024-11-08 17:26:56,953 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17
[2024-11-08 17:26:56,953 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:56,953 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions.
[2024-11-08 17:26:56,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions.
[2024-11-08 17:26:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-08 17:26:56,954 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:56,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:26:56,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times
[2024-11-08 17:26:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098935046]
[2024-11-08 17:26:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098935046]
[2024-11-08 17:26:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098935046] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:26:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924381197]
[2024-11-08 17:26:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:26:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:26:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:26:57,011 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:57,048 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions.
[2024-11-08 17:26:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:26:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2024-11-08 17:26:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:57,051 INFO L225 Difference]: With dead ends: 314
[2024-11-08 17:26:57,052 INFO L226 Difference]: Without dead ends: 133
[2024-11-08 17:26:57,052 INFO L431 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
[2024-11-08 17:26:57,057 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 33 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:57,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:26:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2024-11-08 17:26:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131.
[2024-11-08 17:26:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.623076923076923) internal successors, (211), 130 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions.
[2024-11-08 17:26:57,074 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18
[2024-11-08 17:26:57,078 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:57,078 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions.
[2024-11-08 17:26:57,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions.
[2024-11-08 17:26:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-08 17:26:57,080 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:57,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:57,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:26:57,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:57,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times
[2024-11-08 17:26:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567591066]
[2024-11-08 17:26:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 17:26:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:57,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567591066]
[2024-11-08 17:26:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567591066] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:57,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:57,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:26:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178788975]
[2024-11-08 17:26:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:57,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:26:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:26:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:26:57,180 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:57,238 INFO L93 Difference]: Finished difference Result 267 states and 431 transitions.
[2024-11-08 17:26:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:26:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24
[2024-11-08 17:26:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:57,241 INFO L225 Difference]: With dead ends: 267
[2024-11-08 17:26:57,241 INFO L226 Difference]: Without dead ends: 139
[2024-11-08 17:26:57,242 INFO L431 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
[2024-11-08 17:26:57,247 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 35 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:57,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 306 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:26:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2024-11-08 17:26:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137.
[2024-11-08 17:26:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 136 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 218 transitions.
[2024-11-08 17:26:57,266 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 218 transitions. Word has length 24
[2024-11-08 17:26:57,266 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 218 transitions.
[2024-11-08 17:26:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 218 transitions.
[2024-11-08 17:26:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-08 17:26:57,271 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:57,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:57,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 17:26:57,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times
[2024-11-08 17:26:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738636936]
[2024-11-08 17:26:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738636936]
[2024-11-08 17:26:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738636936] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:26:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144990352]
[2024-11-08 17:26:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:57,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:26:57,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:26:57,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:26:57,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 17:26:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:57,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:26:57,546 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:26:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:57,662 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:26:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144990352] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:26:57,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:26:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5
[2024-11-08 17:26:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045432312]
[2024-11-08 17:26:57,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:26:57,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:26:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:26:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:26:57,749 INFO L87 Difference]: Start difference. First operand 137 states and 218 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:58,058 INFO L93 Difference]: Finished difference Result 254 states and 409 transitions.
[2024-11-08 17:26:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:26:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 26
[2024-11-08 17:26:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:58,065 INFO L225 Difference]: With dead ends: 254
[2024-11-08 17:26:58,065 INFO L226 Difference]: Without dead ends: 239
[2024-11-08 17:26:58,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:26:58,067 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 298 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:58,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 704 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:26:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2024-11-08 17:26:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 220.
[2024-11-08 17:26:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6484018264840183) internal successors, (361), 219 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 361 transitions.
[2024-11-08 17:26:58,091 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 361 transitions. Word has length 26
[2024-11-08 17:26:58,092 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:58,092 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 361 transitions.
[2024-11-08 17:26:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 361 transitions.
[2024-11-08 17:26:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-08 17:26:58,093 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:58,094 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:58,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 17:26:58,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:26:58,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:58,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times
[2024-11-08 17:26:58,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:58,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810342408]
[2024-11-08 17:26:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810342408]
[2024-11-08 17:26:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810342408] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:26:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601872108]
[2024-11-08 17:26:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:26:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:26:58,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:26:58,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 17:26:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:58,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 17:26:58,806 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:26:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:58,978 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:26:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:26:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601872108] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:26:59,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:26:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-11-08 17:26:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566631790]
[2024-11-08 17:26:59,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:26:59,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:26:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:59,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:26:59,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:26:59,233 INFO L87 Difference]: Start difference. First operand 220 states and 361 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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)
[2024-11-08 17:26:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:59,552 INFO L93 Difference]: Finished difference Result 458 states and 751 transitions.
[2024-11-08 17:26:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:26:59,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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 27
[2024-11-08 17:26:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:59,556 INFO L225 Difference]: With dead ends: 458
[2024-11-08 17:26:59,556 INFO L226 Difference]: Without dead ends: 239
[2024-11-08 17:26:59,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:26:59,560 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 71 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:59,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 875 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:26:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2024-11-08 17:26:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239.
[2024-11-08 17:26:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 238 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)
[2024-11-08 17:26:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions.
[2024-11-08 17:26:59,585 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 27
[2024-11-08 17:26:59,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions.
[2024-11-08 17:26:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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)
[2024-11-08 17:26:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions.
[2024-11-08 17:26:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2024-11-08 17:26:59,587 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:59,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:26:59,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 17:26:59,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2024-11-08 17:26:59,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:59,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -895020851, now seen corresponding path program 1 times
[2024-11-08 17:26:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719449586]
[2024-11-08 17:26:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:26:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:26:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 17:26:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:26:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719449586]
[2024-11-08 17:26:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719449586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:26:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:26:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:26:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832754192]
[2024-11-08 17:26:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:26:59,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:26:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:26:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:26:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:26:59,892 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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)
[2024-11-08 17:26:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:26:59,940 INFO L93 Difference]: Finished difference Result 447 states and 721 transitions.
[2024-11-08 17:26:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:26:59,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 34
[2024-11-08 17:26:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:26:59,944 INFO L225 Difference]: With dead ends: 447
[2024-11-08 17:26:59,944 INFO L226 Difference]: Without dead ends: 211
[2024-11-08 17:26:59,945 INFO L431 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
[2024-11-08 17:26:59,946 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:26:59,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:26:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2024-11-08 17:26:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2024-11-08 17:26:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5769230769230769) internal successors, (328), 208 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:26:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions.
[2024-11-08 17:26:59,965 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 34
[2024-11-08 17:26:59,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:26:59,966 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions.
[2024-11-08 17:26:59,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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)
[2024-11-08 17:26:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions.
[2024-11-08 17:26:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2024-11-08 17:26:59,971 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:26:59,971 INFO L215 NwaCegarLoop]: trace histogram [4, 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]
[2024-11-08 17:26:59,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 17:26:59,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:26:59,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:26:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times
[2024-11-08 17:26:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:26:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151760412]
[2024-11-08 17:26:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:26:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:00,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:00,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151760412]
[2024-11-08 17:27:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151760412] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651806468]
[2024-11-08 17:27:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:00,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:00,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:00,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 17:27:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:00,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:00,483 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:00,607 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651806468] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:01,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2024-11-08 17:27:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105148349]
[2024-11-08 17:27:01,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:01,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 17:27:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 17:27:01,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:27:01,085 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:01,861 INFO L93 Difference]: Finished difference Result 628 states and 997 transitions.
[2024-11-08 17:27:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 17:27:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2024-11-08 17:27:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:01,864 INFO L225 Difference]: With dead ends: 628
[2024-11-08 17:27:01,865 INFO L226 Difference]: Without dead ends: 397
[2024-11-08 17:27:01,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2024-11-08 17:27:01,866 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 548 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:01,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 923 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 17:27:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2024-11-08 17:27:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 382.
[2024-11-08 17:27:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5774278215223096) internal successors, (601), 381 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 601 transitions.
[2024-11-08 17:27:01,879 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 601 transitions. Word has length 37
[2024-11-08 17:27:01,880 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:01,880 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 601 transitions.
[2024-11-08 17:27:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 601 transitions.
[2024-11-08 17:27:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2024-11-08 17:27:01,882 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:01,882 INFO L215 NwaCegarLoop]: trace histogram [4, 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]
[2024-11-08 17:27:01,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 17:27:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:02,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:02,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times
[2024-11-08 17:27:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283267362]
[2024-11-08 17:27:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:27:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283267362]
[2024-11-08 17:27:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283267362] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315712640]
[2024-11-08 17:27:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:02,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:02,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 17:27:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:02,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:02,453 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:27:02,515 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:27:02,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315712640] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:02,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:02,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4
[2024-11-08 17:27:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908117848]
[2024-11-08 17:27:02,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:02,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:27:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:27:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:27:02,591 INFO L87 Difference]: Start difference. First operand 382 states and 601 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:02,774 INFO L93 Difference]: Finished difference Result 394 states and 612 transitions.
[2024-11-08 17:27:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:27:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38
[2024-11-08 17:27:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:02,779 INFO L225 Difference]: With dead ends: 394
[2024-11-08 17:27:02,779 INFO L226 Difference]: Without dead ends: 382
[2024-11-08 17:27:02,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:27:02,780 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 192 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 436 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:27:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states.
[2024-11-08 17:27:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382.
[2024-11-08 17:27:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5354330708661417) internal successors, (585), 381 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 585 transitions.
[2024-11-08 17:27:02,794 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 585 transitions. Word has length 38
[2024-11-08 17:27:02,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:02,794 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 585 transitions.
[2024-11-08 17:27:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 585 transitions.
[2024-11-08 17:27:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-08 17:27:02,796 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:02,796 INFO L215 NwaCegarLoop]: trace histogram [4, 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]
[2024-11-08 17:27:02,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 17:27:03,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:03,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times
[2024-11-08 17:27:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731617775]
[2024-11-08 17:27:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731617775]
[2024-11-08 17:27:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731617775] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259273066]
[2024-11-08 17:27:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:03,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:03,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 17:27:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:03,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:03,757 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:04,041 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259273066] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:04,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-11-08 17:27:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858885648]
[2024-11-08 17:27:04,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:27:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:27:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:27:04,426 INFO L87 Difference]: Start difference. First operand 382 states and 585 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:04,745 INFO L93 Difference]: Finished difference Result 388 states and 591 transitions.
[2024-11-08 17:27:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:27:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 40
[2024-11-08 17:27:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:04,748 INFO L225 Difference]: With dead ends: 388
[2024-11-08 17:27:04,748 INFO L226 Difference]: Without dead ends: 386
[2024-11-08 17:27:04,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:27:04,749 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 92 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:04,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1049 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:27:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states.
[2024-11-08 17:27:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383.
[2024-11-08 17:27:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5340314136125655) internal successors, (586), 382 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 586 transitions.
[2024-11-08 17:27:04,762 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 586 transitions. Word has length 40
[2024-11-08 17:27:04,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:04,763 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 586 transitions.
[2024-11-08 17:27:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 586 transitions.
[2024-11-08 17:27:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-11-08 17:27:04,764 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:04,764 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1]
[2024-11-08 17:27:04,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 17:27:04,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:04,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times
[2024-11-08 17:27:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:04,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113806361]
[2024-11-08 17:27:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 17:27:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113806361]
[2024-11-08 17:27:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113806361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:27:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:27:05,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:27:05,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948011013]
[2024-11-08 17:27:05,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:27:05,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:27:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:27:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:27:05,028 INFO L87 Difference]: Start difference. First operand 383 states and 586 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:05,073 INFO L93 Difference]: Finished difference Result 720 states and 1100 transitions.
[2024-11-08 17:27:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:27:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41
[2024-11-08 17:27:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:05,076 INFO L225 Difference]: With dead ends: 720
[2024-11-08 17:27:05,077 INFO L226 Difference]: Without dead ends: 382
[2024-11-08 17:27:05,077 INFO L431 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
[2024-11-08 17:27:05,078 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 246 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
[2024-11-08 17:27:05,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:27:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states.
[2024-11-08 17:27:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380.
[2024-11-08 17:27:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.4986807387862797) internal successors, (568), 379 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 568 transitions.
[2024-11-08 17:27:05,091 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 568 transitions. Word has length 41
[2024-11-08 17:27:05,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:05,091 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 568 transitions.
[2024-11-08 17:27:05,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 568 transitions.
[2024-11-08 17:27:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2024-11-08 17:27:05,093 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:05,093 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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]
[2024-11-08 17:27:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 17:27:05,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1803942129, now seen corresponding path program 1 times
[2024-11-08 17:27:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627158109]
[2024-11-08 17:27:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2024-11-08 17:27:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627158109]
[2024-11-08 17:27:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627158109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:27:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:27:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:27:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453114032]
[2024-11-08 17:27:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:27:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:27:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:27:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:27:05,170 INFO L87 Difference]: Start difference. First operand 380 states and 568 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:05,209 INFO L93 Difference]: Finished difference Result 548 states and 819 transitions.
[2024-11-08 17:27:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:27:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 51
[2024-11-08 17:27:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:05,211 INFO L225 Difference]: With dead ends: 548
[2024-11-08 17:27:05,212 INFO L226 Difference]: Without dead ends: 233
[2024-11-08 17:27:05,212 INFO L431 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
[2024-11-08 17:27:05,213 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:05,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:27:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2024-11-08 17:27:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231.
[2024-11-08 17:27:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4565217391304348) internal successors, (335), 230 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions.
[2024-11-08 17:27:05,221 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 51
[2024-11-08 17:27:05,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:05,222 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions.
[2024-11-08 17:27:05,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions.
[2024-11-08 17:27:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2024-11-08 17:27:05,222 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:05,223 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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]
[2024-11-08 17:27:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 17:27:05,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -866165618, now seen corresponding path program 1 times
[2024-11-08 17:27:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440075873]
[2024-11-08 17:27:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440075873]
[2024-11-08 17:27:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440075873] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000639366]
[2024-11-08 17:27:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:05,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:05,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:05,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 17:27:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:05,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:05,516 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:05,587 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000639366] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:05,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:05,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9
[2024-11-08 17:27:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486459509]
[2024-11-08 17:27:05,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:05,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:27:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:27:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:27:05,684 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:05,910 INFO L93 Difference]: Finished difference Result 874 states and 1309 transitions.
[2024-11-08 17:27:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 17:27:05,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 52
[2024-11-08 17:27:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:05,917 INFO L225 Difference]: With dead ends: 874
[2024-11-08 17:27:05,917 INFO L226 Difference]: Without dead ends: 783
[2024-11-08 17:27:05,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:27:05,919 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 912 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:05,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 840 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:27:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2024-11-08 17:27:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 746.
[2024-11-08 17:27:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.476510067114094) internal successors, (1100), 745 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1100 transitions.
[2024-11-08 17:27:05,942 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1100 transitions. Word has length 52
[2024-11-08 17:27:05,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1100 transitions.
[2024-11-08 17:27:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1100 transitions.
[2024-11-08 17:27:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-08 17:27:05,944 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:05,945 INFO L215 NwaCegarLoop]: trace histogram [5, 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]
[2024-11-08 17:27:05,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 17:27:06,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-11-08 17:27:06,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:06,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1723595032, now seen corresponding path program 1 times
[2024-11-08 17:27:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:06,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755320751]
[2024-11-08 17:27:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755320751]
[2024-11-08 17:27:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755320751] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800779717]
[2024-11-08 17:27:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:06,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:06,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 17:27:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:06,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:06,617 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:27:06,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:27:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800779717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:27:06,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 17:27:06,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6
[2024-11-08 17:27:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731721512]
[2024-11-08 17:27:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:27:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:27:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:27:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:27:06,735 INFO L87 Difference]: Start difference. First operand 746 states and 1100 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:06,842 INFO L93 Difference]: Finished difference Result 749 states and 1102 transitions.
[2024-11-08 17:27:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:27:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 55
[2024-11-08 17:27:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:06,847 INFO L225 Difference]: With dead ends: 749
[2024-11-08 17:27:06,847 INFO L226 Difference]: Without dead ends: 746
[2024-11-08 17:27:06,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:27:06,849 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 164 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:06,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 425 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:27:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states.
[2024-11-08 17:27:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746.
[2024-11-08 17:27:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.47248322147651) internal successors, (1097), 745 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1097 transitions.
[2024-11-08 17:27:06,897 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1097 transitions. Word has length 55
[2024-11-08 17:27:06,897 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1097 transitions.
[2024-11-08 17:27:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1097 transitions.
[2024-11-08 17:27:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-08 17:27:06,898 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:06,899 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1]
[2024-11-08 17:27:06,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-08 17:27:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:07,103 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times
[2024-11-08 17:27:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047887919]
[2024-11-08 17:27:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047887919]
[2024-11-08 17:27:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047887919] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108029927]
[2024-11-08 17:27:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:07,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:07,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:07,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-08 17:27:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:07,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:07,813 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:08,062 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108029927] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:08,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-08 17:27:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706056076]
[2024-11-08 17:27:08,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:08,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 17:27:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 17:27:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-08 17:27:08,684 INFO L87 Difference]: Start difference. First operand 746 states and 1097 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 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)
[2024-11-08 17:27:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:08,902 INFO L93 Difference]: Finished difference Result 748 states and 1098 transitions.
[2024-11-08 17:27:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 17:27:08,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 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
[2024-11-08 17:27:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:08,906 INFO L225 Difference]: With dead ends: 748
[2024-11-08 17:27:08,907 INFO L226 Difference]: Without dead ends: 746
[2024-11-08 17:27:08,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-08 17:27:08,908 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 155 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:08,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 870 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:27:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states.
[2024-11-08 17:27:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746.
[2024-11-08 17:27:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.4684563758389262) internal successors, (1094), 745 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1094 transitions.
[2024-11-08 17:27:08,930 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1094 transitions. Word has length 56
[2024-11-08 17:27:08,930 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:08,930 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1094 transitions.
[2024-11-08 17:27:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 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)
[2024-11-08 17:27:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1094 transitions.
[2024-11-08 17:27:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2024-11-08 17:27:08,932 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:08,932 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1]
[2024-11-08 17:27:08,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-08 17:27:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:09,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times
[2024-11-08 17:27:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414820300]
[2024-11-08 17:27:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414820300]
[2024-11-08 17:27:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414820300] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380926953]
[2024-11-08 17:27:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:09,805 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:09,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-08 17:27:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:09,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:09,968 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:10,242 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-11-08 17:27:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380926953] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:10,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:10,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12
[2024-11-08 17:27:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870451566]
[2024-11-08 17:27:10,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:10,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 17:27:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 17:27:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:27:10,693 INFO L87 Difference]: Start difference. First operand 746 states and 1094 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:11,275 INFO L93 Difference]: Finished difference Result 838 states and 1228 transitions.
[2024-11-08 17:27:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-08 17:27:11,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63
[2024-11-08 17:27:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:11,282 INFO L225 Difference]: With dead ends: 838
[2024-11-08 17:27:11,282 INFO L226 Difference]: Without dead ends: 828
[2024-11-08 17:27:11,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2024-11-08 17:27:11,284 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 258 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:11,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 2017 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 17:27:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states.
[2024-11-08 17:27:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828.
[2024-11-08 17:27:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4292623941958889) internal successors, (1182), 827 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1182 transitions.
[2024-11-08 17:27:11,312 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1182 transitions. Word has length 63
[2024-11-08 17:27:11,312 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1182 transitions.
[2024-11-08 17:27:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1182 transitions.
[2024-11-08 17:27:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-08 17:27:11,314 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:11,314 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1]
[2024-11-08 17:27:11,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-08 17:27:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-11-08 17:27:11,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:11,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times
[2024-11-08 17:27:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543108852]
[2024-11-08 17:27:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 17:27:12,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543108852]
[2024-11-08 17:27:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543108852] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754469547]
[2024-11-08 17:27:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:12,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:12,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:12,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-08 17:27:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:12,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:12,585 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:13,066 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754469547] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:14,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21
[2024-11-08 17:27:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109319635]
[2024-11-08 17:27:14,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:14,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-11-08 17:27:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:14,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-08 17:27:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420
[2024-11-08 17:27:14,061 INFO L87 Difference]: Start difference. First operand 828 states and 1182 transitions. Second operand has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:14,635 INFO L93 Difference]: Finished difference Result 830 states and 1183 transitions.
[2024-11-08 17:27:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-08 17:27:14,636 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2024-11-08 17:27:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:14,640 INFO L225 Difference]: With dead ends: 830
[2024-11-08 17:27:14,640 INFO L226 Difference]: Without dead ends: 828
[2024-11-08 17:27:14,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506
[2024-11-08 17:27:14,642 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 287 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:14,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 2204 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 17:27:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states.
[2024-11-08 17:27:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828.
[2024-11-08 17:27:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.426844014510278) internal successors, (1180), 827 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1180 transitions.
[2024-11-08 17:27:14,672 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1180 transitions. Word has length 86
[2024-11-08 17:27:14,673 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:14,673 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1180 transitions.
[2024-11-08 17:27:14,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.619047619047619) internal successors, (223), 21 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1180 transitions.
[2024-11-08 17:27:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2024-11-08 17:27:14,679 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:14,680 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:27:14,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-08 17:27:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-08 17:27:14,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -520376012, now seen corresponding path program 1 times
[2024-11-08 17:27:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622185932]
[2024-11-08 17:27:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:27:15,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622185932]
[2024-11-08 17:27:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622185932] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34805054]
[2024-11-08 17:27:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:15,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:15,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:15,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-08 17:27:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:15,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:15,717 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:27:16,032 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:27:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34805054] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:16,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17
[2024-11-08 17:27:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013078969]
[2024-11-08 17:27:16,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-08 17:27:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-08 17:27:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2024-11-08 17:27:16,386 INFO L87 Difference]: Start difference. First operand 828 states and 1180 transitions. Second operand has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:16,863 INFO L93 Difference]: Finished difference Result 2427 states and 3465 transitions.
[2024-11-08 17:27:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-08 17:27:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 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 147
[2024-11-08 17:27:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:16,871 INFO L225 Difference]: With dead ends: 2427
[2024-11-08 17:27:16,871 INFO L226 Difference]: Without dead ends: 1863
[2024-11-08 17:27:16,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2024-11-08 17:27:16,873 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1939 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:16,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 1745 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:27:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states.
[2024-11-08 17:27:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1764.
[2024-11-08 17:27:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.4316505955757233) internal successors, (2524), 1763 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2524 transitions.
[2024-11-08 17:27:16,924 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2524 transitions. Word has length 147
[2024-11-08 17:27:16,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2524 transitions.
[2024-11-08 17:27:16,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2524 transitions.
[2024-11-08 17:27:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2024-11-08 17:27:16,927 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:16,928 INFO L215 NwaCegarLoop]: trace histogram [13, 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, 1]
[2024-11-08 17:27:16,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-11-08 17:27:17,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:17,132 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:17,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 1 times
[2024-11-08 17:27:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897593874]
[2024-11-08 17:27:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-08 17:27:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897593874]
[2024-11-08 17:27:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897593874] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659396982]
[2024-11-08 17:27:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:18,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:18,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-08 17:27:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:18,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 37 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:18,722 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:19,679 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 142 proven. 311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:27:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659396982] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:21,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32
[2024-11-08 17:27:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778223357]
[2024-11-08 17:27:21,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:21,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-11-08 17:27:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-08 17:27:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992
[2024-11-08 17:27:21,486 INFO L87 Difference]: Start difference. First operand 1764 states and 2524 transitions. Second operand has 32 states, 32 states have (on average 11.59375) internal successors, (371), 32 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:22,111 INFO L93 Difference]: Finished difference Result 1766 states and 2525 transitions.
[2024-11-08 17:27:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-11-08 17:27:22,112 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.59375) internal successors, (371), 32 states have internal predecessors, (371), 0 states have call successors, (0), 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 148
[2024-11-08 17:27:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:22,120 INFO L225 Difference]: With dead ends: 1766
[2024-11-08 17:27:22,120 INFO L226 Difference]: Without dead ends: 1764
[2024-11-08 17:27:22,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190
[2024-11-08 17:27:22,123 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 601 mSDsluCounter, 4016 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 4343 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:22,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 4343 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 17:27:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states.
[2024-11-08 17:27:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764.
[2024-11-08 17:27:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.4288145207033465) internal successors, (2519), 1763 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2519 transitions.
[2024-11-08 17:27:22,173 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2519 transitions. Word has length 148
[2024-11-08 17:27:22,173 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:22,173 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2519 transitions.
[2024-11-08 17:27:22,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.59375) internal successors, (371), 32 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2519 transitions.
[2024-11-08 17:27:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332
[2024-11-08 17:27:22,181 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:22,181 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 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, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:27:22,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-11-08 17:27:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:22,382 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:22,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash -691826832, now seen corresponding path program 2 times
[2024-11-08 17:27:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895083251]
[2024-11-08 17:27:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:27:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-08 17:27:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:27:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895083251]
[2024-11-08 17:27:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895083251] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:27:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160782914]
[2024-11-08 17:27:24,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:27:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:27:24,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:27:24,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-11-08 17:27:25,073 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:27:25,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:27:25,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 17:27:25,089 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:27:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-08 17:27:25,646 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:27:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-08 17:27:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160782914] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:27:26,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:27:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20
[2024-11-08 17:27:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956221619]
[2024-11-08 17:27:26,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:27:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-11-08 17:27:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:27:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-08 17:27:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2024-11-08 17:27:26,571 INFO L87 Difference]: Start difference. First operand 1764 states and 2519 transitions. Second operand has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:27:27,080 INFO L93 Difference]: Finished difference Result 3384 states and 4841 transitions.
[2024-11-08 17:27:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-11-08 17:27:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 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 331
[2024-11-08 17:27:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:27:27,091 INFO L225 Difference]: With dead ends: 3384
[2024-11-08 17:27:27,091 INFO L226 Difference]: Without dead ends: 2196
[2024-11-08 17:27:27,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 647 SyntacticMatches, 25 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2024-11-08 17:27:27,094 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2136 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:27:27,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 2160 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:27:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states.
[2024-11-08 17:27:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2115.
[2024-11-08 17:27:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2114 states have (on average 1.4290444654683065) internal successors, (3021), 2114 states have internal predecessors, (3021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 3021 transitions.
[2024-11-08 17:27:27,186 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 3021 transitions. Word has length 331
[2024-11-08 17:27:27,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:27:27,187 INFO L471 AbstractCegarLoop]: Abstraction has 2115 states and 3021 transitions.
[2024-11-08 17:27:27,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:27:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 3021 transitions.
[2024-11-08 17:27:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396
[2024-11-08 17:27:27,197 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:27:27,197 INFO L215 NwaCegarLoop]: trace histogram [35, 34, 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, 1, 1]
[2024-11-08 17:27:27,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-11-08 17:27:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:27:27,402 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:27:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:27:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 1 times
[2024-11-08 17:27:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:27:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720686451]
[2024-11-08 17:27:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:27:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:27:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:27:28,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:27:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:27:28,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:27:28,887 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:27:28,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 17:27:28,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-08 17:27:28,896 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:27:29,204 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:27:29,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:27:29 BoogieIcfgContainer
[2024-11-08 17:27:29,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:27:29,209 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:27:29,209 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:27:29,209 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:27:29,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:26:54" (3/4) ...
[2024-11-08 17:27:29,211 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 17:27:29,511 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 17:27:29,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:27:29,513 INFO L158 Benchmark]: Toolchain (without parser) took 37111.47ms. Allocated memory was 157.3MB in the beginning and 482.3MB in the end (delta: 325.1MB). Free memory was 114.1MB in the beginning and 385.6MB in the end (delta: -271.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,516 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 157.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:27:29,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.73ms. Allocated memory is still 157.3MB. Free memory was 114.1MB in the beginning and 92.7MB in the end (delta: 21.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.69ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 88.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,517 INFO L158 Benchmark]: Boogie Preprocessor took 128.86ms. Allocated memory is still 157.3MB. Free memory was 88.0MB in the beginning and 83.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,518 INFO L158 Benchmark]: RCFGBuilder took 1481.00ms. Allocated memory was 157.3MB in the beginning and 230.7MB in the end (delta: 73.4MB). Free memory was 83.8MB in the beginning and 177.2MB in the end (delta: -93.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,518 INFO L158 Benchmark]: TraceAbstraction took 34366.12ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 176.2MB in the beginning and 420.1MB in the end (delta: -243.9MB). Peak memory consumption was 270.8MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,518 INFO L158 Benchmark]: Witness Printer took 303.44ms. Allocated memory is still 482.3MB. Free memory was 420.1MB in the beginning and 385.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-08 17:27:29,524 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.39ms. Allocated memory is still 157.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 713.73ms. Allocated memory is still 157.3MB. Free memory was 114.1MB in the beginning and 92.7MB in the end (delta: 21.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 107.69ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 88.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 128.86ms. Allocated memory is still 157.3MB. Free memory was 88.0MB in the beginning and 83.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1481.00ms. Allocated memory was 157.3MB in the beginning and 230.7MB in the end (delta: 73.4MB). Free memory was 83.8MB in the beginning and 177.2MB in the end (delta: -93.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 34366.12ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 176.2MB in the beginning and 420.1MB in the end (delta: -243.9MB). Peak memory consumption was 270.8MB. Max. memory is 16.1GB.
* Witness Printer took 303.44ms. Allocated memory is still 482.3MB. Free memory was 420.1MB in the beginning and 385.6MB in the end (delta: 34.5MB). 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;
VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3]
[L18] int q = 0;
[L19] int method_id;
[L22] int this_expect = 0;
[L23] int this_buffer_empty = 0;
VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, 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]
[L45] COND TRUE q == 0
[L46] COND TRUE __VERIFIER_nondet_int()
[L50] method_id = 1
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, 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]
[L52] COND FALSE !(0)
[L56] q = 1
[L58] this_expect=0
[L58] this_buffer_empty=1
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=0]
[L45] COND FALSE !(q == 0)
VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=1]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=1]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=1]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=1]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=1]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=1]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=1]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=2]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=2]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=2]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=2]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=2]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=2]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=3]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=3]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=3]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=3]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=3]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=3]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=3]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=4]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=4]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=4]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=4]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=4]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=4]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=5]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=5]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=5]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=5]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=5]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=5]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=5]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=6]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=6]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=6]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=6]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=6]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=6]
[L45] COND FALSE !(q == 0)
VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=7]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=7]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=7]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=7]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=7]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=7]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=7]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=8]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=8]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=8]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=8]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=8]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=8]
[L45] COND FALSE !(q == 0)
VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=9]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=9]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=9]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=9]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=9]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=9]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=9]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=-1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=10]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=10]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=10]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=10]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=10]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=10]
[L45] COND FALSE !(q == 0)
VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=11]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=11]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=11]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=11]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=11]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=11]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=11]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=12]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=12]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=12]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=12]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=12]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=12]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=13]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=13]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=13]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=13]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=13]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=13]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=13]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=14]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=14]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=14]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=14]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=14]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=14]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=-1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=15]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=15]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=15]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=-1, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=15]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=15]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=15]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=4, this_buffer_empty=1, this_expect=15]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=1, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=16]
[L45] COND FALSE !(q == 0)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=16]
[L65] COND FALSE !(q == 1)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=16]
[L165] COND FALSE !(q == 2)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=16]
[L265] COND FALSE !(q == 3)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=5, this_buffer_empty=0, this_expect=16]
[L365] COND FALSE !(q == 4)
VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=1, this_buffer_empty=1, this_expect=16]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=-16]
[L45] COND FALSE !(q == 0)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=-16]
[L65] COND FALSE !(q == 1)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3, this_buffer_empty=0, this_expect=-16]
[L165] COND FALSE !(q == 2)
VAL [P1=0, P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P3=0, P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, 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 [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3]
[L571] reach_error()
VAL [P4=0, P6=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=3]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 22, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7991 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7991 mSDsluCounter, 20792 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16841 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3394 IncrementalHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 3951 mSDtfsCounter, 3394 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2291 GetRequests, 2105 SyntacticMatches, 29 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2115occurred in iteration=21, InterpolantAutomatonStates: 161, 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, 21 MinimizatonAttempts, 273 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 2813 NumberOfCodeBlocks, 2813 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3423 ConstructedInterpolants, 0 QuantifiedInterpolants, 16162 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5067 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 46 InterpolantComputations, 9 PerfectInterpolantSequences, 2068/11693 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!
[2024-11-08 17:27:29,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9467dfd-d9f0-49d7-8d0c-cafcd66cea88/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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