./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
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_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:33:40,236 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:33:40,351 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:33:40,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:33:40,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:33:40,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:33:40,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:33:40,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:33:40,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:33:40,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:33:40,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:33:40,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:33:40,417 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:33:40,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:33:40,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:33:40,419 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:33:40,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:33:40,420 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:33:40,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:33:40,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:33:40,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:33:40,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:33:40,423 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:33:40,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:33:40,425 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:33:40,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:33:40,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:33:40,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:33:40,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:33:40,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:33:40,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:33:40,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:33:40,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:33:40,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:33:40,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:33:40,431 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:33:40,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:33:40,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:33:40,432 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:33:40,432 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_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/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_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu
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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da
[2023-11-19 07:33:40,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:33:40,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:33:40,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:33:40,789 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:33:40,790 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:33:40,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i
[2023-11-19 07:33:44,191 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:33:44,596 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:33:44,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i
[2023-11-19 07:33:44,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/data/3062415cc/c5a74554fc954ac2bb2e9dc3c96afd95/FLAG7157ab406
[2023-11-19 07:33:44,645 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/data/3062415cc/c5a74554fc954ac2bb2e9dc3c96afd95
[2023-11-19 07:33:44,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:33:44,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:33:44,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:33:44,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:33:44,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:33:44,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:44" (1/1) ...
[2023-11-19 07:33:44,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f56ddc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:44, skipping insertion in model container
[2023-11-19 07:33:44,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:44" (1/1) ...
[2023-11-19 07:33:44,738 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:33:44,929 WARN L240 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_1bfc155c-d222-46a7-8c85-83a002029a9a/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i[949,962]
[2023-11-19 07:33:45,152 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:33:45,164 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:33:45,177 WARN L240 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_1bfc155c-d222-46a7-8c85-83a002029a9a/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i[949,962]
[2023-11-19 07:33:45,229 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:33:45,265 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:33:45,265 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:33:45,273 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:33:45,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45 WrapperNode
[2023-11-19 07:33:45,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:33:45,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:33:45,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:33:45,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:33:45,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,340 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154
[2023-11-19 07:33:45,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:33:45,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:33:45,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:33:45,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:33:45,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:33:45,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:33:45,390 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:33:45,391 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:33:45,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (1/1) ...
[2023-11-19 07:33:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:33:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:33:45,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:33:45,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:33:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:33:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:33:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:33:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:33:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:33:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:33:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:33:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:33:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:33:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:33:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:33:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:33:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:33:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:33:45,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:33:45,489 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:33:45,632 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:33:45,634 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:33:46,116 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:33:46,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:33:46,302 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:33:46,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:46 BoogieIcfgContainer
[2023-11-19 07:33:46,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:33:46,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:33:46,316 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:33:46,320 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:33:46,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:44" (1/3) ...
[2023-11-19 07:33:46,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea619ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:46, skipping insertion in model container
[2023-11-19 07:33:46,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45" (2/3) ...
[2023-11-19 07:33:46,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea619ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:46, skipping insertion in model container
[2023-11-19 07:33:46,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:46" (3/3) ...
[2023-11-19 07:33:46,324 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i
[2023-11-19 07:33:46,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:33:46,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:33:46,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:33:46,341 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:33:46,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:33:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 252 flow
[2023-11-19 07:33:46,508 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events.
[2023-11-19 07:33:46,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:33:46,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place.
[2023-11-19 07:33:46,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 120 transitions, 252 flow
[2023-11-19 07:33:46,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 117 transitions, 243 flow
[2023-11-19 07:33:46,526 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:33:46,538 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 243 flow
[2023-11-19 07:33:46,541 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 243 flow
[2023-11-19 07:33:46,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 243 flow
[2023-11-19 07:33:46,576 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events.
[2023-11-19 07:33:46,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:33:46,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place.
[2023-11-19 07:33:46,581 INFO L119 LiptonReduction]: Number of co-enabled transitions 2610
[2023-11-19 07:33:51,632 INFO L134 LiptonReduction]: Checked pairs total: 6376
[2023-11-19 07:33:51,633 INFO L136 LiptonReduction]: Total number of compositions: 101
[2023-11-19 07:33:51,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:33:51,658 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@2cc4b012, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:33:51,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-11-19 07:33:51,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:33:51,663 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events.
[2023-11-19 07:33:51,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:33:51,663 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:51,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:33:51,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:51,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 489327620, now seen corresponding path program 1 times
[2023-11-19 07:33:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:51,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799587475]
[2023-11-19 07:33:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:52,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799587475]
[2023-11-19 07:33:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799587475] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:52,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:33:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589729719]
[2023-11-19 07:33:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:52,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:33:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:33:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:33:52,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 221
[2023-11-19 07:33:52,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:52,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:52,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 221
[2023-11-19 07:33:52,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:52,698 INFO L124 PetriNetUnfolderBase]: 999/1626 cut-off events.
[2023-11-19 07:33:52,698 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES.
[2023-11-19 07:33:52,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 1626 events. 999/1626 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8403 event pairs, 277 based on Foata normal form. 64/1541 useless extension candidates. Maximal degree in co-relation 3150. Up to 1195 conditions per place.
[2023-11-19 07:33:52,714 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 29 selfloop transitions, 2 changer transitions 4/40 dead transitions.
[2023-11-19 07:33:52,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 162 flow
[2023-11-19 07:33:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:33:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:33:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions.
[2023-11-19 07:33:52,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324283559577677
[2023-11-19 07:33:52,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions.
[2023-11-19 07:33:52,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions.
[2023-11-19 07:33:52,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:52,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions.
[2023-11-19 07:33:52,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:52,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:52,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:52,750 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 353 transitions.
[2023-11-19 07:33:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 162 flow
[2023-11-19 07:33:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:33:52,756 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow
[2023-11-19 07:33:52,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24}
[2023-11-19 07:33:52,762 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places.
[2023-11-19 07:33:52,763 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow
[2023-11-19 07:33:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:52,763 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:52,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:33:52,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:52,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -672995107, now seen corresponding path program 1 times
[2023-11-19 07:33:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74905386]
[2023-11-19 07:33:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74905386]
[2023-11-19 07:33:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74905386] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:53,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:53,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:33:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051177716]
[2023-11-19 07:33:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:53,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:33:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:33:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:33:53,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221
[2023-11-19 07:33:53,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:53,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:53,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221
[2023-11-19 07:33:53,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:54,226 INFO L124 PetriNetUnfolderBase]: 1683/2510 cut-off events.
[2023-11-19 07:33:54,227 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES.
[2023-11-19 07:33:54,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 2510 events. 1683/2510 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11941 event pairs, 423 based on Foata normal form. 144/2653 useless extension candidates. Maximal degree in co-relation 5174. Up to 1665 conditions per place.
[2023-11-19 07:33:54,245 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 33 selfloop transitions, 2 changer transitions 22/58 dead transitions.
[2023-11-19 07:33:54,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 244 flow
[2023-11-19 07:33:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:33:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:33:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions.
[2023-11-19 07:33:54,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45610859728506786
[2023-11-19 07:33:54,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions.
[2023-11-19 07:33:54,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions.
[2023-11-19 07:33:54,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:54,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions.
[2023-11-19 07:33:54,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,268 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 504 transitions.
[2023-11-19 07:33:54,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 244 flow
[2023-11-19 07:33:54,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:33:54,274 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow
[2023-11-19 07:33:54,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24}
[2023-11-19 07:33:54,275 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places.
[2023-11-19 07:33:54,281 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow
[2023-11-19 07:33:54,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,282 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:54,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:33:54,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:54,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -756183620, now seen corresponding path program 1 times
[2023-11-19 07:33:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657012365]
[2023-11-19 07:33:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657012365]
[2023-11-19 07:33:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657012365] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:54,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:33:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112624659]
[2023-11-19 07:33:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:33:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:33:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:33:54,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221
[2023-11-19 07:33:54,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:54,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221
[2023-11-19 07:33:54,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:54,901 INFO L124 PetriNetUnfolderBase]: 774/1261 cut-off events.
[2023-11-19 07:33:54,901 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES.
[2023-11-19 07:33:54,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1261 events. 774/1261 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6162 event pairs, 263 based on Foata normal form. 60/1308 useless extension candidates. Maximal degree in co-relation 2628. Up to 679 conditions per place.
[2023-11-19 07:33:54,913 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 26 selfloop transitions, 2 changer transitions 15/47 dead transitions.
[2023-11-19 07:33:54,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 200 flow
[2023-11-19 07:33:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:33:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:33:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions.
[2023-11-19 07:33:54,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48868778280542985
[2023-11-19 07:33:54,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions.
[2023-11-19 07:33:54,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions.
[2023-11-19 07:33:54,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:54,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions.
[2023-11-19 07:33:54,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,924 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 540 transitions.
[2023-11-19 07:33:54,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 200 flow
[2023-11-19 07:33:54,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 192 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 07:33:54,932 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow
[2023-11-19 07:33:54,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24}
[2023-11-19 07:33:54,934 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places.
[2023-11-19 07:33:54,937 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow
[2023-11-19 07:33:54,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:54,938 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:54,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:33:54,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:54,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1885683563, now seen corresponding path program 1 times
[2023-11-19 07:33:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228064786]
[2023-11-19 07:33:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228064786]
[2023-11-19 07:33:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228064786] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:33:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944135698]
[2023-11-19 07:33:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:55,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:33:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:33:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:33:55,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221
[2023-11-19 07:33:55,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:55,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:55,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221
[2023-11-19 07:33:55,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:56,112 INFO L124 PetriNetUnfolderBase]: 836/1368 cut-off events.
[2023-11-19 07:33:56,112 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES.
[2023-11-19 07:33:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1368 events. 836/1368 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6503 event pairs, 268 based on Foata normal form. 45/1401 useless extension candidates. Maximal degree in co-relation 2930. Up to 1039 conditions per place.
[2023-11-19 07:33:56,124 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 42 selfloop transitions, 12 changer transitions 17/75 dead transitions.
[2023-11-19 07:33:56,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 75 transitions, 332 flow
[2023-11-19 07:33:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:33:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:33:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 850 transitions.
[2023-11-19 07:33:56,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308
[2023-11-19 07:33:56,128 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 850 transitions.
[2023-11-19 07:33:56,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 850 transitions.
[2023-11-19 07:33:56,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:56,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 850 transitions.
[2023-11-19 07:33:56,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.25) internal successors, (850), 8 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:56,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:56,138 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:56,139 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 8 states and 850 transitions.
[2023-11-19 07:33:56,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 75 transitions, 332 flow
[2023-11-19 07:33:56,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 75 transitions, 324 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 07:33:56,144 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 153 flow
[2023-11-19 07:33:56,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=35}
[2023-11-19 07:33:56,145 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places.
[2023-11-19 07:33:56,146 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 153 flow
[2023-11-19 07:33:56,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:56,146 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:56,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:33:56,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:56,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 241003517, now seen corresponding path program 2 times
[2023-11-19 07:33:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:56,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876216757]
[2023-11-19 07:33:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876216757]
[2023-11-19 07:33:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876216757] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:33:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724906703]
[2023-11-19 07:33:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:56,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:33:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:33:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:33:56,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 221
[2023-11-19 07:33:56,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:56,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 221
[2023-11-19 07:33:56,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:57,235 INFO L124 PetriNetUnfolderBase]: 859/1415 cut-off events.
[2023-11-19 07:33:57,235 INFO L125 PetriNetUnfolderBase]: For 1712/1841 co-relation queries the response was YES.
[2023-11-19 07:33:57,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 1415 events. 859/1415 cut-off events. For 1712/1841 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6878 event pairs, 331 based on Foata normal form. 71/1469 useless extension candidates. Maximal degree in co-relation 4123. Up to 1062 conditions per place.
[2023-11-19 07:33:57,250 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 42 selfloop transitions, 12 changer transitions 14/72 dead transitions.
[2023-11-19 07:33:57,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 429 flow
[2023-11-19 07:33:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:33:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:33:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions.
[2023-11-19 07:33:57,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717
[2023-11-19 07:33:57,254 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions.
[2023-11-19 07:33:57,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions.
[2023-11-19 07:33:57,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:57,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions.
[2023-11-19 07:33:57,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:57,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:57,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:57,262 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 153 flow. Second operand 6 states and 646 transitions.
[2023-11-19 07:33:57,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 429 flow
[2023-11-19 07:33:57,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 427 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-19 07:33:57,271 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 243 flow
[2023-11-19 07:33:57,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=41}
[2023-11-19 07:33:57,272 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places.
[2023-11-19 07:33:57,272 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 243 flow
[2023-11-19 07:33:57,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:57,273 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:57,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:57,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:33:57,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:57,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash 573802554, now seen corresponding path program 1 times
[2023-11-19 07:33:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550947219]
[2023-11-19 07:33:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550947219]
[2023-11-19 07:33:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550947219] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:33:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721922182]
[2023-11-19 07:33:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:57,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:33:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:33:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:33:57,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221
[2023-11-19 07:33:57,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:57,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:57,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221
[2023-11-19 07:33:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:58,412 INFO L124 PetriNetUnfolderBase]: 856/1434 cut-off events.
[2023-11-19 07:33:58,412 INFO L125 PetriNetUnfolderBase]: For 3099/3243 co-relation queries the response was YES.
[2023-11-19 07:33:58,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4931 conditions, 1434 events. 856/1434 cut-off events. For 3099/3243 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7094 event pairs, 244 based on Foata normal form. 46/1457 useless extension candidates. Maximal degree in co-relation 4908. Up to 1017 conditions per place.
[2023-11-19 07:33:58,428 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 54 selfloop transitions, 17 changer transitions 11/86 dead transitions.
[2023-11-19 07:33:58,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 604 flow
[2023-11-19 07:33:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:33:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:33:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 743 transitions.
[2023-11-19 07:33:58,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48028442146089206
[2023-11-19 07:33:58,433 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 743 transitions.
[2023-11-19 07:33:58,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 743 transitions.
[2023-11-19 07:33:58,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:58,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 743 transitions.
[2023-11-19 07:33:58,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.14285714285714) internal successors, (743), 7 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:58,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:58,441 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:58,441 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 243 flow. Second operand 7 states and 743 transitions.
[2023-11-19 07:33:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 604 flow
[2023-11-19 07:33:58,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 596 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-11-19 07:33:58,456 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 363 flow
[2023-11-19 07:33:58,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=58, PETRI_TRANSITIONS=50}
[2023-11-19 07:33:58,459 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places.
[2023-11-19 07:33:58,459 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 363 flow
[2023-11-19 07:33:58,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:58,460 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:58,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:58,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:33:58,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:58,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash -562128276, now seen corresponding path program 2 times
[2023-11-19 07:33:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805573829]
[2023-11-19 07:33:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:33:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:33:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:33:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805573829]
[2023-11-19 07:33:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805573829] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:33:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:33:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:33:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454616235]
[2023-11-19 07:33:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:33:59,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:33:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:33:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:33:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:33:59,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221
[2023-11-19 07:33:59,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 363 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:59,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:33:59,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221
[2023-11-19 07:33:59,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:33:59,664 INFO L124 PetriNetUnfolderBase]: 867/1459 cut-off events.
[2023-11-19 07:33:59,665 INFO L125 PetriNetUnfolderBase]: For 5671/5873 co-relation queries the response was YES.
[2023-11-19 07:33:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5980 conditions, 1459 events. 867/1459 cut-off events. For 5671/5873 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7306 event pairs, 252 based on Foata normal form. 52/1490 useless extension candidates. Maximal degree in co-relation 5952. Up to 1037 conditions per place.
[2023-11-19 07:33:59,684 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 56 selfloop transitions, 22 changer transitions 7/89 dead transitions.
[2023-11-19 07:33:59,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 759 flow
[2023-11-19 07:33:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:33:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:33:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2023-11-19 07:33:59,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48340874811463047
[2023-11-19 07:33:59,688 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2023-11-19 07:33:59,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2023-11-19 07:33:59,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:33:59,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2023-11-19 07:33:59,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:59,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:59,695 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:59,695 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 363 flow. Second operand 6 states and 641 transitions.
[2023-11-19 07:33:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 759 flow
[2023-11-19 07:33:59,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 705 flow, removed 21 selfloop flow, removed 2 redundant places.
[2023-11-19 07:33:59,722 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 482 flow
[2023-11-19 07:33:59,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=62, PETRI_TRANSITIONS=59}
[2023-11-19 07:33:59,723 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places.
[2023-11-19 07:33:59,723 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 482 flow
[2023-11-19 07:33:59,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:33:59,724 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:33:59,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:33:59,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:33:59,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:33:59,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:33:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash 179977274, now seen corresponding path program 3 times
[2023-11-19 07:33:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:33:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113676214]
[2023-11-19 07:33:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:33:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:33:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:00,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113676214]
[2023-11-19 07:34:00,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113676214] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:00,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:00,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:34:00,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563219192]
[2023-11-19 07:34:00,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:00,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:34:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:34:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:34:00,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221
[2023-11-19 07:34:00,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:00,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:00,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221
[2023-11-19 07:34:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:00,745 INFO L124 PetriNetUnfolderBase]: 964/1606 cut-off events.
[2023-11-19 07:34:00,746 INFO L125 PetriNetUnfolderBase]: For 8377/8673 co-relation queries the response was YES.
[2023-11-19 07:34:00,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7187 conditions, 1606 events. 964/1606 cut-off events. For 8377/8673 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8085 event pairs, 224 based on Foata normal form. 88/1673 useless extension candidates. Maximal degree in co-relation 7156. Up to 1046 conditions per place.
[2023-11-19 07:34:00,767 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 59 selfloop transitions, 28 changer transitions 7/98 dead transitions.
[2023-11-19 07:34:00,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 912 flow
[2023-11-19 07:34:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:34:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:34:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions.
[2023-11-19 07:34:00,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738202973497091
[2023-11-19 07:34:00,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions.
[2023-11-19 07:34:00,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions.
[2023-11-19 07:34:00,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:00,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions.
[2023-11-19 07:34:00,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:00,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:00,781 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:00,781 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 482 flow. Second operand 7 states and 733 transitions.
[2023-11-19 07:34:00,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 912 flow
[2023-11-19 07:34:00,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 836 flow, removed 32 selfloop flow, removed 4 redundant places.
[2023-11-19 07:34:00,809 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 585 flow
[2023-11-19 07:34:00,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=65, PETRI_TRANSITIONS=66}
[2023-11-19 07:34:00,813 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places.
[2023-11-19 07:34:00,813 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 585 flow
[2023-11-19 07:34:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:00,814 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:00,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:34:00,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:00,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1039294080, now seen corresponding path program 1 times
[2023-11-19 07:34:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:00,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308577873]
[2023-11-19 07:34:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308577873]
[2023-11-19 07:34:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308577873] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:01,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:34:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458723038]
[2023-11-19 07:34:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:01,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:34:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:01,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:34:01,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:34:01,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221
[2023-11-19 07:34:01,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:01,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:01,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221
[2023-11-19 07:34:01,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:02,508 INFO L124 PetriNetUnfolderBase]: 2674/4017 cut-off events.
[2023-11-19 07:34:02,509 INFO L125 PetriNetUnfolderBase]: For 22841/23213 co-relation queries the response was YES.
[2023-11-19 07:34:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18024 conditions, 4017 events. 2674/4017 cut-off events. For 22841/23213 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20352 event pairs, 228 based on Foata normal form. 380/4380 useless extension candidates. Maximal degree in co-relation 17993. Up to 2146 conditions per place.
[2023-11-19 07:34:02,547 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 110 selfloop transitions, 15 changer transitions 35/165 dead transitions.
[2023-11-19 07:34:02,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 165 transitions, 1717 flow
[2023-11-19 07:34:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:34:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:34:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions.
[2023-11-19 07:34:02,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955
[2023-11-19 07:34:02,552 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions.
[2023-11-19 07:34:02,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions.
[2023-11-19 07:34:02,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:02,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions.
[2023-11-19 07:34:02,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:02,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:02,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:02,560 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 585 flow. Second operand 7 states and 680 transitions.
[2023-11-19 07:34:02,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 165 transitions, 1717 flow
[2023-11-19 07:34:02,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1620 flow, removed 29 selfloop flow, removed 4 redundant places.
[2023-11-19 07:34:02,606 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 726 flow
[2023-11-19 07:34:02,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=726, PETRI_PLACES=71, PETRI_TRANSITIONS=79}
[2023-11-19 07:34:02,608 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places.
[2023-11-19 07:34:02,608 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 726 flow
[2023-11-19 07:34:02,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:02,609 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:02,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:02,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:34:02,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:02,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1229408820, now seen corresponding path program 2 times
[2023-11-19 07:34:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879448297]
[2023-11-19 07:34:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879448297]
[2023-11-19 07:34:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879448297] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:34:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606469980]
[2023-11-19 07:34:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:34:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:34:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:34:02,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221
[2023-11-19 07:34:02,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:02,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:02,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221
[2023-11-19 07:34:02,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:03,202 INFO L124 PetriNetUnfolderBase]: 704/1237 cut-off events.
[2023-11-19 07:34:03,202 INFO L125 PetriNetUnfolderBase]: For 8322/8459 co-relation queries the response was YES.
[2023-11-19 07:34:03,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 1237 events. 704/1237 cut-off events. For 8322/8459 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6500 event pairs, 173 based on Foata normal form. 112/1333 useless extension candidates. Maximal degree in co-relation 6019. Up to 943 conditions per place.
[2023-11-19 07:34:03,214 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 66 selfloop transitions, 4 changer transitions 5/86 dead transitions.
[2023-11-19 07:34:03,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 925 flow
[2023-11-19 07:34:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:34:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:34:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions.
[2023-11-19 07:34:03,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113122171945701
[2023-11-19 07:34:03,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions.
[2023-11-19 07:34:03,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions.
[2023-11-19 07:34:03,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:03,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions.
[2023-11-19 07:34:03,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,221 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 726 flow. Second operand 3 states and 339 transitions.
[2023-11-19 07:34:03,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 925 flow
[2023-11-19 07:34:03,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 898 flow, removed 3 selfloop flow, removed 3 redundant places.
[2023-11-19 07:34:03,236 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 574 flow
[2023-11-19 07:34:03,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=70, PETRI_TRANSITIONS=64}
[2023-11-19 07:34:03,237 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places.
[2023-11-19 07:34:03,237 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 574 flow
[2023-11-19 07:34:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,237 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:03,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:34:03,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:03,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1678885329, now seen corresponding path program 1 times
[2023-11-19 07:34:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963275420]
[2023-11-19 07:34:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:03,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963275420]
[2023-11-19 07:34:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963275420] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:03,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:34:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108449645]
[2023-11-19 07:34:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:03,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:34:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:34:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:34:03,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221
[2023-11-19 07:34:03,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 574 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:03,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221
[2023-11-19 07:34:03,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:03,645 INFO L124 PetriNetUnfolderBase]: 308/621 cut-off events.
[2023-11-19 07:34:03,646 INFO L125 PetriNetUnfolderBase]: For 3734/3791 co-relation queries the response was YES.
[2023-11-19 07:34:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 621 events. 308/621 cut-off events. For 3734/3791 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3053 event pairs, 58 based on Foata normal form. 83/695 useless extension candidates. Maximal degree in co-relation 3039. Up to 197 conditions per place.
[2023-11-19 07:34:03,651 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 69 selfloop transitions, 7 changer transitions 1/88 dead transitions.
[2023-11-19 07:34:03,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 938 flow
[2023-11-19 07:34:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:34:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:34:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions.
[2023-11-19 07:34:03,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113122171945701
[2023-11-19 07:34:03,654 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions.
[2023-11-19 07:34:03,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions.
[2023-11-19 07:34:03,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:03,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions.
[2023-11-19 07:34:03,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,660 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,660 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 574 flow. Second operand 4 states and 452 transitions.
[2023-11-19 07:34:03,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 938 flow
[2023-11-19 07:34:03,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 831 flow, removed 29 selfloop flow, removed 5 redundant places.
[2023-11-19 07:34:03,670 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 506 flow
[2023-11-19 07:34:03,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=69, PETRI_TRANSITIONS=61}
[2023-11-19 07:34:03,671 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places.
[2023-11-19 07:34:03,671 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 506 flow
[2023-11-19 07:34:03,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,672 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:03,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:03,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:34:03,673 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:03,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash 57779919, now seen corresponding path program 1 times
[2023-11-19 07:34:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036566402]
[2023-11-19 07:34:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036566402]
[2023-11-19 07:34:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036566402] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:34:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58369347]
[2023-11-19 07:34:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:03,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:34:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:34:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:34:03,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221
[2023-11-19 07:34:03,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:03,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:03,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221
[2023-11-19 07:34:03,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:04,122 INFO L124 PetriNetUnfolderBase]: 251/495 cut-off events.
[2023-11-19 07:34:04,122 INFO L125 PetriNetUnfolderBase]: For 2083/2144 co-relation queries the response was YES.
[2023-11-19 07:34:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 495 events. 251/495 cut-off events. For 2083/2144 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2379 event pairs, 49 based on Foata normal form. 41/524 useless extension candidates. Maximal degree in co-relation 2236. Up to 189 conditions per place.
[2023-11-19 07:34:04,126 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 50 selfloop transitions, 10 changer transitions 20/87 dead transitions.
[2023-11-19 07:34:04,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 850 flow
[2023-11-19 07:34:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:34:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:34:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions.
[2023-11-19 07:34:04,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013574660633484
[2023-11-19 07:34:04,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions.
[2023-11-19 07:34:04,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions.
[2023-11-19 07:34:04,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:04,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions.
[2023-11-19 07:34:04,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,136 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 506 flow. Second operand 5 states and 554 transitions.
[2023-11-19 07:34:04,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 850 flow
[2023-11-19 07:34:04,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 793 flow, removed 22 selfloop flow, removed 5 redundant places.
[2023-11-19 07:34:04,146 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 335 flow
[2023-11-19 07:34:04,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=69, PETRI_TRANSITIONS=46}
[2023-11-19 07:34:04,148 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places.
[2023-11-19 07:34:04,148 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 335 flow
[2023-11-19 07:34:04,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,149 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:04,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:34:04,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:04,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash 270982402, now seen corresponding path program 1 times
[2023-11-19 07:34:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637756135]
[2023-11-19 07:34:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:34:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:34:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:34:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637756135]
[2023-11-19 07:34:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637756135] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:34:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:34:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:34:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670101090]
[2023-11-19 07:34:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:34:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:34:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:34:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:34:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:34:04,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221
[2023-11-19 07:34:04,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:34:04,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221
[2023-11-19 07:34:04,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:34:04,627 INFO L124 PetriNetUnfolderBase]: 253/518 cut-off events.
[2023-11-19 07:34:04,628 INFO L125 PetriNetUnfolderBase]: For 1910/1935 co-relation queries the response was YES.
[2023-11-19 07:34:04,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 518 events. 253/518 cut-off events. For 1910/1935 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2350 event pairs, 41 based on Foata normal form. 20/534 useless extension candidates. Maximal degree in co-relation 2334. Up to 282 conditions per place.
[2023-11-19 07:34:04,631 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 41 selfloop transitions, 1 changer transitions 40/87 dead transitions.
[2023-11-19 07:34:04,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 799 flow
[2023-11-19 07:34:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:34:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:34:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions.
[2023-11-19 07:34:04,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695
[2023-11-19 07:34:04,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions.
[2023-11-19 07:34:04,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions.
[2023-11-19 07:34:04,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:34:04,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions.
[2023-11-19 07:34:04,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,641 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 335 flow. Second operand 5 states and 527 transitions.
[2023-11-19 07:34:04,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 799 flow
[2023-11-19 07:34:04,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 653 flow, removed 33 selfloop flow, removed 14 redundant places.
[2023-11-19 07:34:04,650 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 215 flow
[2023-11-19 07:34:04,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=60, PETRI_TRANSITIONS=39}
[2023-11-19 07:34:04,652 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places.
[2023-11-19 07:34:04,652 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 215 flow
[2023-11-19 07:34:04,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:34:04,653 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:34:04,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:34:04,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:34:04,654 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:34:04,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:34:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2023985544, now seen corresponding path program 2 times
[2023-11-19 07:34:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:34:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588547923]
[2023-11-19 07:34:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:34:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:34:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:34:04,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:34:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:34:04,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:34:04,833 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:34:04,834 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2023-11-19 07:34:04,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2023-11-19 07:34:04,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2023-11-19 07:34:04,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2023-11-19 07:34:04,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2023-11-19 07:34:04,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2023-11-19 07:34:04,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:34:04,838 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1]
[2023-11-19 07:34:04,849 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:34:04,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:34:04,923 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
[2023-11-19 07:34:04,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:34:04,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:34:04,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:34:04 BasicIcfg
[2023-11-19 07:34:04,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:34:04,973 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:34:04,974 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:34:04,974 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:34:04,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:46" (3/4) ...
[2023-11-19 07:34:04,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:34:05,012 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
[2023-11-19 07:34:05,013 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:34:05,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:34:05,107 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:34:05,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:34:05,108 INFO L158 Benchmark]: Toolchain (without parser) took 20452.57ms. Allocated memory was 123.7MB in the beginning and 285.2MB in the end (delta: 161.5MB). Free memory was 91.8MB in the beginning and 249.8MB in the end (delta: -157.9MB). Peak memory consumption was 173.4MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,109 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:34:05,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.76ms. Allocated memory is still 123.7MB. Free memory was 91.4MB in the beginning and 68.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.25ms. Allocated memory is still 123.7MB. Free memory was 68.0MB in the beginning and 65.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,110 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 123.7MB. Free memory was 65.1MB in the beginning and 63.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,110 INFO L158 Benchmark]: RCFGBuilder took 922.02ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 63.0MB in the beginning and 113.1MB in the end (delta: -50.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,111 INFO L158 Benchmark]: TraceAbstraction took 18656.81ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 113.1MB in the beginning and 94.0MB in the end (delta: 19.1MB). Peak memory consumption was 140.6MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,111 INFO L158 Benchmark]: Witness Printer took 134.31ms. Allocated memory is still 285.2MB. Free memory was 94.0MB in the beginning and 249.8MB in the end (delta: -155.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-19 07:34:05,117 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.35ms. Allocated memory is still 100.7MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 617.76ms. Allocated memory is still 123.7MB. Free memory was 91.4MB in the beginning and 68.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 65.25ms. Allocated memory is still 123.7MB. Free memory was 68.0MB in the beginning and 65.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 47.75ms. Allocated memory is still 123.7MB. Free memory was 65.1MB in the beginning and 63.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 922.02ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 63.0MB in the beginning and 113.1MB in the end (delta: -50.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 18656.81ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 113.1MB in the beginning and 94.0MB in the end (delta: 19.1MB). Peak memory consumption was 140.6MB. Max. memory is 16.1GB.
* Witness Printer took 134.31ms. Allocated memory is still 285.2MB. Free memory was 94.0MB in the beginning and 249.8MB in the end (delta: -155.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 5.1s, 124 PlacesBefore, 37 PlacesAfterwards, 117 TransitionsBefore, 28 TransitionsAfterwards, 2610 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 6376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3105, independent: 2918, independent conditional: 0, independent unconditional: 2918, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1480, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3105, independent: 1478, independent conditional: 0, independent unconditional: 1478, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1480, unknown conditional: 0, unknown unconditional: 1480] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p1_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 int __unbuffered_p2_EBX = 0;
[L719] 0 int a = 0;
[L721] 0 int b = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L726] 0 _Bool x$flush_delayed;
[L727] 0 int x$mem_tmp;
[L728] 0 _Bool x$r_buff0_thd0;
[L729] 0 _Bool x$r_buff0_thd1;
[L730] 0 _Bool x$r_buff0_thd2;
[L731] 0 _Bool x$r_buff0_thd3;
[L732] 0 _Bool x$r_buff1_thd0;
[L733] 0 _Bool x$r_buff1_thd1;
[L734] 0 _Bool x$r_buff1_thd2;
[L735] 0 _Bool x$r_buff1_thd3;
[L736] 0 _Bool x$read_delayed;
[L737] 0 int *x$read_delayed_var;
[L738] 0 int x$w_buff0;
[L739] 0 _Bool x$w_buff0_used;
[L740] 0 int x$w_buff1;
[L741] 0 _Bool x$w_buff1_used;
[L743] 0 int y = 0;
[L745] 0 int z = 0;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L840] 0 pthread_t t891;
[L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L842] 0 pthread_t t892;
[L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L771] 2 x$w_buff1 = x$w_buff0
[L772] 2 x$w_buff0 = 2
[L773] 2 x$w_buff1_used = x$w_buff0_used
[L774] 2 x$w_buff0_used = (_Bool)1
[L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L780] 2 x$r_buff0_thd2 = (_Bool)1
[L783] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L844] 0 pthread_t t893;
[L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L786] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L789] 2 __unbuffered_p1_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L806] 3 z = 1
[L809] 3 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L812] 3 __unbuffered_p2_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L815] 3 __unbuffered_p2_EBX = b
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L751] 1 b = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L754] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L766] 1 return 0;
[L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L801] 2 return 0;
[L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L827] 3 return 0;
[L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L849] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L849] RET 0 assume_abort_if_not(main$tmp_guard0)
[L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
[L858] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L859] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L860] 0 x$flush_delayed = weak$$choice2
[L861] 0 x$mem_tmp = x
[L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L870] 0 x = x$flush_delayed ? x$mem_tmp : x
[L871] 0 x$flush_delayed = (_Bool)0
[L873] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1675 IncrementalHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 58 mSDtfsCounter, 1675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=9, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 1367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-19 07:34:05,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc155c-d222-46a7-8c85-83a002029a9a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE