./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008.opt.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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:44:45,120 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:44:45,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:44:45,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:44:45,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:44:45,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:44:45,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:44:45,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:44:45,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:44:45,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:44:45,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:44:45,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:44:45,300 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:44:45,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:44:45,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:44:45,303 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:44:45,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:44:45,304 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:44:45,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:44:45,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:44:45,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:44:45,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:44:45,307 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:44:45,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:44:45,308 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:44:45,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:44:45,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:44:45,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:44:45,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:44:45,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:44:45,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:44:45,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:44:45,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:44:45,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:44:45,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:44:45,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:44:45,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:44:45,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:44:45,315 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:44:45,315 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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8
[2023-11-19 07:44:45,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:44:45,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:44:45,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:44:45,627 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:44:45,628 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:44:45,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i
[2023-11-19 07:44:48,787 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:44:49,138 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:44:49,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/sv-benchmarks/c/pthread-wmm/mix008.opt.i
[2023-11-19 07:44:49,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/data/765a2f716/0da3f098ac6b41ebb910cfdcd5547c24/FLAGefc93cf68
[2023-11-19 07:44:49,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/data/765a2f716/0da3f098ac6b41ebb910cfdcd5547c24
[2023-11-19 07:44:49,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:44:49,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:44:49,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:44:49,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:44:49,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:44:49,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:49,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53208c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49, skipping insertion in model container
[2023-11-19 07:44:49,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:49,271 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:44:49,441 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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957]
[2023-11-19 07:44:49,709 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:44:49,729 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:44:49,743 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_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957]
[2023-11-19 07:44:49,877 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:44:49,916 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:44:49,916 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:44:49,924 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:44:49,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49 WrapperNode
[2023-11-19 07:44:49,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:44:49,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:44:49,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:44:49,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:44:49,935 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:44:49" (1/1) ...
[2023-11-19 07:44:49,974 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:44:49" (1/1) ...
[2023-11-19 07:44:50,033 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164
[2023-11-19 07:44:50,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:44:50,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:44:50,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:44:50,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:44:50,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:44:50,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:44:50,104 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:44:50,104 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:44:50,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (1/1) ...
[2023-11-19 07:44:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:44:50,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:44:50,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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:44:50,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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:44:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:44:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:44:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:44:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:44:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:44:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:44:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:44:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:44:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:44:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:44:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:44:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2023-11-19 07:44:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2023-11-19 07:44:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:44:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:44:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:44:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:44:50,195 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:44:50,384 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:44:50,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:44:50,841 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:44:51,095 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:44:51,096 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:44:51,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:51 BoogieIcfgContainer
[2023-11-19 07:44:51,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:44:51,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:44:51,109 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:44:51,113 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:44:51,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:44:49" (1/3) ...
[2023-11-19 07:44:51,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d644c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:51, skipping insertion in model container
[2023-11-19 07:44:51,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:49" (2/3) ...
[2023-11-19 07:44:51,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d644c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:51, skipping insertion in model container
[2023-11-19 07:44:51,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:51" (3/3) ...
[2023-11-19 07:44:51,119 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i
[2023-11-19 07:44:51,127 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:44:51,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:44:51,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:44:51,137 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:44:51,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:44:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:44:51,376 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:44:51,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:44:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place.
[2023-11-19 07:44:51,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:44:51,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow
[2023-11-19 07:44:51,431 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:44:51,455 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:44:51,458 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:44:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow
[2023-11-19 07:44:51,535 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:44:51,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:44:51,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place.
[2023-11-19 07:44:51,543 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490
[2023-11-19 07:44:56,335 INFO L134 LiptonReduction]: Checked pairs total: 7603
[2023-11-19 07:44:56,335 INFO L136 LiptonReduction]: Total number of compositions: 116
[2023-11-19 07:44:56,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:44:56,381 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;@bcb5db1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:44:56,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-19 07:44:56,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:44:56,388 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events.
[2023-11-19 07:44:56,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:44:56,389 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:44:56,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:44:56,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:44:56,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:44:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1366080650, now seen corresponding path program 1 times
[2023-11-19 07:44:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:44:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788396109]
[2023-11-19 07:44:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:44:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:44:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:44:57,023 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:44:57,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:44:57,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788396109]
[2023-11-19 07:44:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788396109] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:44:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:44:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:44:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224334399]
[2023-11-19 07:44:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:44:57,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:44:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:44:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:44:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:44:57,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 251
[2023-11-19 07:44:57,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:44:57,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:44:57,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 251
[2023-11-19 07:44:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:44:58,490 INFO L124 PetriNetUnfolderBase]: 4903/7008 cut-off events.
[2023-11-19 07:44:58,492 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES.
[2023-11-19 07:44:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13856 conditions, 7008 events. 4903/7008 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 36063 event pairs, 999 based on Foata normal form. 0/6672 useless extension candidates. Maximal degree in co-relation 13844. Up to 5185 conditions per place.
[2023-11-19 07:44:58,559 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 34 selfloop transitions, 2 changer transitions 2/40 dead transitions.
[2023-11-19 07:44:58,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 168 flow
[2023-11-19 07:44:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:44:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:44:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-11-19 07:44:58,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365205843293492
[2023-11-19 07:44:58,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-11-19 07:44:58,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-11-19 07:44:58,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:44:58,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-11-19 07:44:58,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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:44:58,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:44:58,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:44:58,609 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 404 transitions.
[2023-11-19 07:44:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 168 flow
[2023-11-19 07:44:58,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-19 07:44:58,620 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow
[2023-11-19 07:44:58,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2023-11-19 07:44:58,629 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2023-11-19 07:44:58,629 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow
[2023-11-19 07:44:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:44:58,630 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:44:58,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:44:58,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:44:58,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:44:58,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:44:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1456533779, now seen corresponding path program 1 times
[2023-11-19 07:44:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:44:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791418454]
[2023-11-19 07:44:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:44:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:44:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:44:59,053 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:44:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:44:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791418454]
[2023-11-19 07:44:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791418454] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:44:59,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:44:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:44:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106225230]
[2023-11-19 07:44:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:44:59,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:44:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:44:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:44:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:44:59,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251
[2023-11-19 07:44:59,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:44:59,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:44:59,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251
[2023-11-19 07:44:59,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:01,181 INFO L124 PetriNetUnfolderBase]: 9457/13034 cut-off events.
[2023-11-19 07:45:01,183 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES.
[2023-11-19 07:45:01,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26894 conditions, 13034 events. 9457/13034 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 66095 event pairs, 3309 based on Foata normal form. 364/13398 useless extension candidates. Maximal degree in co-relation 26884. Up to 8217 conditions per place.
[2023-11-19 07:45:01,315 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 38 selfloop transitions, 9 changer transitions 0/47 dead transitions.
[2023-11-19 07:45:01,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow
[2023-11-19 07:45:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:45:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:45:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions.
[2023-11-19 07:45:01,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50199203187251
[2023-11-19 07:45:01,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions.
[2023-11-19 07:45:01,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions.
[2023-11-19 07:45:01,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:01,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions.
[2023-11-19 07:45:01,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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:45:01,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:01,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:01,326 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 378 transitions.
[2023-11-19 07:45:01,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow
[2023-11-19 07:45:01,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:45:01,347 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 130 flow
[2023-11-19 07:45:01,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=34}
[2023-11-19 07:45:01,352 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places.
[2023-11-19 07:45:01,352 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 130 flow
[2023-11-19 07:45:01,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:45:01,353 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:01,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:01,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:45:01,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:01,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2092093940, now seen corresponding path program 1 times
[2023-11-19 07:45:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423289584]
[2023-11-19 07:45:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:01,624 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:45:01,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:01,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423289584]
[2023-11-19 07:45:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423289584] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:45:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059275739]
[2023-11-19 07:45:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:01,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251
[2023-11-19 07:45:01,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 130 flow. Second operand has 4 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:45:01,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:01,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251
[2023-11-19 07:45:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:03,556 INFO L124 PetriNetUnfolderBase]: 8597/11866 cut-off events.
[2023-11-19 07:45:03,556 INFO L125 PetriNetUnfolderBase]: For 5648/5648 co-relation queries the response was YES.
[2023-11-19 07:45:03,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31636 conditions, 11866 events. 8597/11866 cut-off events. For 5648/5648 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 60071 event pairs, 2031 based on Foata normal form. 168/12034 useless extension candidates. Maximal degree in co-relation 31624. Up to 5317 conditions per place.
[2023-11-19 07:45:03,642 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 56 selfloop transitions, 9 changer transitions 0/65 dead transitions.
[2023-11-19 07:45:03,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 356 flow
[2023-11-19 07:45:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:45:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:45:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions.
[2023-11-19 07:45:03,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49701195219123506
[2023-11-19 07:45:03,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions.
[2023-11-19 07:45:03,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions.
[2023-11-19 07:45:03,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:03,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions.
[2023-11-19 07:45:03,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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:45:03,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:03,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:03,653 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 130 flow. Second operand 4 states and 499 transitions.
[2023-11-19 07:45:03,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 356 flow
[2023-11-19 07:45:03,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:45:03,707 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 180 flow
[2023-11-19 07:45:03,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=39}
[2023-11-19 07:45:03,708 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places.
[2023-11-19 07:45:03,708 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 180 flow
[2023-11-19 07:45:03,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:45:03,709 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:03,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:03,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:45:03,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:03,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1477945572, now seen corresponding path program 1 times
[2023-11-19 07:45:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:03,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027766962]
[2023-11-19 07:45:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:03,888 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:45:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027766962]
[2023-11-19 07:45:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027766962] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:45:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632227095]
[2023-11-19 07:45:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:03,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:03,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:03,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251
[2023-11-19 07:45:03,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:45:03,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:03,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251
[2023-11-19 07:45:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:05,874 INFO L124 PetriNetUnfolderBase]: 8399/11596 cut-off events.
[2023-11-19 07:45:05,874 INFO L125 PetriNetUnfolderBase]: For 8853/8853 co-relation queries the response was YES.
[2023-11-19 07:45:05,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33025 conditions, 11596 events. 8399/11596 cut-off events. For 8853/8853 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 58620 event pairs, 1365 based on Foata normal form. 36/11632 useless extension candidates. Maximal degree in co-relation 33010. Up to 6647 conditions per place.
[2023-11-19 07:45:05,972 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 58 selfloop transitions, 19 changer transitions 0/77 dead transitions.
[2023-11-19 07:45:05,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 458 flow
[2023-11-19 07:45:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:45:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:45:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions.
[2023-11-19 07:45:05,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299
[2023-11-19 07:45:05,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions.
[2023-11-19 07:45:05,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions.
[2023-11-19 07:45:05,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:05,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions.
[2023-11-19 07:45:05,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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:45:05,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:05,983 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:05,983 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 180 flow. Second operand 4 states and 508 transitions.
[2023-11-19 07:45:05,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 458 flow
[2023-11-19 07:45:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:45:06,025 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 285 flow
[2023-11-19 07:45:06,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=47, PETRI_TRANSITIONS=46}
[2023-11-19 07:45:06,028 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places.
[2023-11-19 07:45:06,028 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 285 flow
[2023-11-19 07:45:06,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:45:06,029 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:06,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:06,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:45:06,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:06,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -457618295, now seen corresponding path program 1 times
[2023-11-19 07:45:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706454614]
[2023-11-19 07:45:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:06,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:06,246 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:45:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706454614]
[2023-11-19 07:45:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706454614] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:45:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4423704]
[2023-11-19 07:45:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:06,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:45:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:45:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:45:06,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 251
[2023-11-19 07:45:06,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:45:06,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:06,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 251
[2023-11-19 07:45:06,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:07,520 INFO L124 PetriNetUnfolderBase]: 7192/10181 cut-off events.
[2023-11-19 07:45:07,520 INFO L125 PetriNetUnfolderBase]: For 19692/19933 co-relation queries the response was YES.
[2023-11-19 07:45:07,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32080 conditions, 10181 events. 7192/10181 cut-off events. For 19692/19933 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 52022 event pairs, 2473 based on Foata normal form. 143/10234 useless extension candidates. Maximal degree in co-relation 32062. Up to 6343 conditions per place.
[2023-11-19 07:45:07,616 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 58 selfloop transitions, 5 changer transitions 0/68 dead transitions.
[2023-11-19 07:45:07,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 554 flow
[2023-11-19 07:45:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:45:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:45:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions.
[2023-11-19 07:45:07,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5298804780876494
[2023-11-19 07:45:07,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions.
[2023-11-19 07:45:07,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions.
[2023-11-19 07:45:07,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:07,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions.
[2023-11-19 07:45:07,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:45:07,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:07,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:07,626 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 285 flow. Second operand 3 states and 399 transitions.
[2023-11-19 07:45:07,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 554 flow
[2023-11-19 07:45:07,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 554 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:45:07,681 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 302 flow
[2023-11-19 07:45:07,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=50, PETRI_TRANSITIONS=46}
[2023-11-19 07:45:07,682 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places.
[2023-11-19 07:45:07,682 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 302 flow
[2023-11-19 07:45:07,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:45:07,683 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:07,683 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:45:07,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:45:07,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:07,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 361857645, now seen corresponding path program 1 times
[2023-11-19 07:45:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973193988]
[2023-11-19 07:45:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:08,047 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:45:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973193988]
[2023-11-19 07:45:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973193988] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:45:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487955380]
[2023-11-19 07:45:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:08,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251
[2023-11-19 07:45:08,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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:45:08,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:08,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251
[2023-11-19 07:45:08,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:09,273 INFO L124 PetriNetUnfolderBase]: 6928/10034 cut-off events.
[2023-11-19 07:45:09,273 INFO L125 PetriNetUnfolderBase]: For 24800/25208 co-relation queries the response was YES.
[2023-11-19 07:45:09,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32908 conditions, 10034 events. 6928/10034 cut-off events. For 24800/25208 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 56436 event pairs, 975 based on Foata normal form. 822/10665 useless extension candidates. Maximal degree in co-relation 32887. Up to 6351 conditions per place.
[2023-11-19 07:45:09,343 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 120 selfloop transitions, 10 changer transitions 0/135 dead transitions.
[2023-11-19 07:45:09,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 135 transitions, 1150 flow
[2023-11-19 07:45:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:45:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:45:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions.
[2023-11-19 07:45:09,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155378486055777
[2023-11-19 07:45:09,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions.
[2023-11-19 07:45:09,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions.
[2023-11-19 07:45:09,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:09,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions.
[2023-11-19 07:45:09,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 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:45:09,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:45:09,354 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:45:09,355 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 302 flow. Second operand 5 states and 647 transitions.
[2023-11-19 07:45:09,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 135 transitions, 1150 flow
[2023-11-19 07:45:09,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 135 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:45:09,402 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 367 flow
[2023-11-19 07:45:09,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=55, PETRI_TRANSITIONS=55}
[2023-11-19 07:45:09,405 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2023-11-19 07:45:09,406 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 367 flow
[2023-11-19 07:45:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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:45:09,406 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:09,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:09,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:45:09,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:09,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 59170604, now seen corresponding path program 1 times
[2023-11-19 07:45:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61158858]
[2023-11-19 07:45:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:09,668 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:45:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61158858]
[2023-11-19 07:45:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61158858] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:45:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677434160]
[2023-11-19 07:45:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:09,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:45:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:45:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:45:09,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 251
[2023-11-19 07:45:09,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:45:09,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:09,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 251
[2023-11-19 07:45:09,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:10,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L802: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_40 256) 0))) (let ((.cse11 (not .cse10)) (.cse3 (and .cse9 .cse10)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse10)) (.cse12 (= 0 (mod v_~z$w_buff0_used~0_114 256)))) (let ((.cse1 (or .cse3 .cse4 .cse12)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse6 (ite .cse1 v_~z~0_102 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_52 256) 0))) (.cse8 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_113 256) 0))) (and (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$w_buff0_used~0_113 (ite .cse0 v_~z$w_buff0_used~0_114 (ite .cse1 v_~z$w_buff0_used~0_114 (ite .cse2 0 v_~z$w_buff0_used~0_114)))) (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_111 0))) (= v_~z~0_100 (ite .cse0 v_~z$mem_tmp~0_38 .cse6)) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_38 v_~z~0_102) (= (ite .cse0 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_39 256) 0))) (or .cse5 (and .cse7 .cse8) (and .cse9 .cse7))) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~__unbuffered_p2_EBX~0_12 .cse6) (= v_~z$r_buff0_thd3~0_39 (ite .cse0 v_~z$r_buff0_thd3~0_40 (ite (or .cse3 .cse5 (and .cse10 .cse8)) v_~z$r_buff0_thd3~0_40 (ite (and (not .cse5) .cse11) 0 v_~z$r_buff0_thd3~0_40)))) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_102} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z~0=v_~z~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][32], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 62#L885true, 71#$Ultimate##0true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, P1Thread1of1ForFork0InUse, Black: 169#(= ~x~0 0), 167#true, P3Thread1of1ForFork3InUse, 69#L802true, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 39#P1EXITtrue, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:10,982 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-11-19 07:45:10,982 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-11-19 07:45:10,982 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-11-19 07:45:10,983 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-11-19 07:45:11,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L753-->L758: Formula: (= v_~x~0_7 1) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0][50], [170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 161#(= ~__unbuffered_p2_EAX~0 0), 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#true, 191#(= ~x~0 1), 62#L885true, Black: 169#(= ~x~0 0), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 85#L786true, 39#P1EXITtrue, 28#L758true, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#true])
[2023-11-19 07:45:11,172 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,172 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,172 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,172 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L802: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_40 256) 0))) (let ((.cse11 (not .cse10)) (.cse3 (and .cse9 .cse10)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse10)) (.cse12 (= 0 (mod v_~z$w_buff0_used~0_114 256)))) (let ((.cse1 (or .cse3 .cse4 .cse12)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse6 (ite .cse1 v_~z~0_102 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_52 256) 0))) (.cse8 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_113 256) 0))) (and (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$w_buff0_used~0_113 (ite .cse0 v_~z$w_buff0_used~0_114 (ite .cse1 v_~z$w_buff0_used~0_114 (ite .cse2 0 v_~z$w_buff0_used~0_114)))) (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_111 0))) (= v_~z~0_100 (ite .cse0 v_~z$mem_tmp~0_38 .cse6)) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_38 v_~z~0_102) (= (ite .cse0 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_39 256) 0))) (or .cse5 (and .cse7 .cse8) (and .cse9 .cse7))) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~__unbuffered_p2_EBX~0_12 .cse6) (= v_~z$r_buff0_thd3~0_39 (ite .cse0 v_~z$r_buff0_thd3~0_40 (ite (or .cse3 .cse5 (and .cse10 .cse8)) v_~z$r_buff0_thd3~0_40 (ite (and (not .cse5) .cse11) 0 v_~z$r_buff0_thd3~0_40)))) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_102} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z~0=v_~z~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][32], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 62#L885true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 169#(= ~x~0 0), P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, 69#L802true, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 49#L753true, 39#P1EXITtrue, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:11,174 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,174 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,174 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,174 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2023-11-19 07:45:11,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L885-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_8 0) (= v_~x~0_15 2) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_16 2) (= v_~__unbuffered_p3_EAX~0_22 1) (= 2 v_~__unbuffered_p2_EAX~0_12))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32| 0) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][86], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 122#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 71#$Ultimate##0true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 169#(= ~x~0 0), P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 85#L786true, 39#P1EXITtrue, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:11,245 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event
[2023-11-19 07:45:11,245 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event
[2023-11-19 07:45:11,245 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event
[2023-11-19 07:45:11,246 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event
[2023-11-19 07:45:11,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L802: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_40 256) 0))) (let ((.cse11 (not .cse10)) (.cse3 (and .cse9 .cse10)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse10)) (.cse12 (= 0 (mod v_~z$w_buff0_used~0_114 256)))) (let ((.cse1 (or .cse3 .cse4 .cse12)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse6 (ite .cse1 v_~z~0_102 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_52 256) 0))) (.cse8 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_113 256) 0))) (and (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$w_buff0_used~0_113 (ite .cse0 v_~z$w_buff0_used~0_114 (ite .cse1 v_~z$w_buff0_used~0_114 (ite .cse2 0 v_~z$w_buff0_used~0_114)))) (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_111 0))) (= v_~z~0_100 (ite .cse0 v_~z$mem_tmp~0_38 .cse6)) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_38 v_~z~0_102) (= (ite .cse0 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_39 256) 0))) (or .cse5 (and .cse7 .cse8) (and .cse9 .cse7))) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~__unbuffered_p2_EBX~0_12 .cse6) (= v_~z$r_buff0_thd3~0_39 (ite .cse0 v_~z$r_buff0_thd3~0_40 (ite (or .cse3 .cse5 (and .cse10 .cse8)) v_~z$r_buff0_thd3~0_40 (ite (and (not .cse5) .cse11) 0 v_~z$r_buff0_thd3~0_40)))) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_102} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z~0=v_~z~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][32], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 62#L885true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 169#(= ~x~0 0), P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, 69#L802true, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 39#P1EXITtrue, 28#L758true, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:11,296 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-11-19 07:45:11,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event
[2023-11-19 07:45:11,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event
[2023-11-19 07:45:11,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event
[2023-11-19 07:45:11,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L885-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_8 0) (= v_~x~0_15 2) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_16 2) (= v_~__unbuffered_p3_EAX~0_22 1) (= 2 v_~__unbuffered_p2_EAX~0_12))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32| 0) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][86], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 122#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 159#true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of1ForFork0InUse, Black: 169#(= ~x~0 0), 167#true, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 49#L753true, 85#L786true, 39#P1EXITtrue, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:11,408 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event
[2023-11-19 07:45:11,408 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event
[2023-11-19 07:45:11,408 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event
[2023-11-19 07:45:11,408 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event
[2023-11-19 07:45:11,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L885-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_8 0) (= v_~x~0_15 2) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_16 2) (= v_~__unbuffered_p3_EAX~0_22 1) (= 2 v_~__unbuffered_p2_EAX~0_12))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_32| 0) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_16, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][86], [189#true, Black: 161#(= ~__unbuffered_p2_EAX~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 122#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 159#true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 169#(= ~x~0 0), P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 179#true, 85#L786true, 39#P1EXITtrue, 28#L758true, 76#L843true, Black: 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 181#(= ~__unbuffered_cnt~0 0), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))])
[2023-11-19 07:45:11,488 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event
[2023-11-19 07:45:11,488 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event
[2023-11-19 07:45:11,488 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event
[2023-11-19 07:45:11,488 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event
[2023-11-19 07:45:11,720 INFO L124 PetriNetUnfolderBase]: 8938/13209 cut-off events.
[2023-11-19 07:45:11,720 INFO L125 PetriNetUnfolderBase]: For 32565/33090 co-relation queries the response was YES.
[2023-11-19 07:45:11,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52252 conditions, 13209 events. 8938/13209 cut-off events. For 32565/33090 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 80404 event pairs, 3346 based on Foata normal form. 185/13128 useless extension candidates. Maximal degree in co-relation 52228. Up to 7134 conditions per place.
[2023-11-19 07:45:11,803 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 65 selfloop transitions, 8 changer transitions 9/87 dead transitions.
[2023-11-19 07:45:11,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 710 flow
[2023-11-19 07:45:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:45:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:45:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions.
[2023-11-19 07:45:11,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325365205843293
[2023-11-19 07:45:11,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions.
[2023-11-19 07:45:11,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions.
[2023-11-19 07:45:11,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:11,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions.
[2023-11-19 07:45:11,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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:45:11,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:11,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:45:11,813 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 367 flow. Second operand 3 states and 401 transitions.
[2023-11-19 07:45:11,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 710 flow
[2023-11-19 07:45:11,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:45:11,966 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 367 flow
[2023-11-19 07:45:11,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2023-11-19 07:45:11,967 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2023-11-19 07:45:11,967 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 367 flow
[2023-11-19 07:45:11,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:45:11,968 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:11,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:11,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:45:11,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:11,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2059713177, now seen corresponding path program 1 times
[2023-11-19 07:45:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964290642]
[2023-11-19 07:45:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:12,306 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:45:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:12,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964290642]
[2023-11-19 07:45:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964290642] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:45:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003868659]
[2023-11-19 07:45:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:12,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:45:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:45:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:45:12,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251
[2023-11-19 07:45:12,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 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:45:12,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:12,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251
[2023-11-19 07:45:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:14,049 INFO L124 PetriNetUnfolderBase]: 6685/10268 cut-off events.
[2023-11-19 07:45:14,049 INFO L125 PetriNetUnfolderBase]: For 32080/32479 co-relation queries the response was YES.
[2023-11-19 07:45:14,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41040 conditions, 10268 events. 6685/10268 cut-off events. For 32080/32479 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 65071 event pairs, 487 based on Foata normal form. 775/10862 useless extension candidates. Maximal degree in co-relation 41015. Up to 3764 conditions per place.
[2023-11-19 07:45:14,095 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 143 selfloop transitions, 17 changer transitions 17/182 dead transitions.
[2023-11-19 07:45:14,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 182 transitions, 1716 flow
[2023-11-19 07:45:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:45:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:45:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 906 transitions.
[2023-11-19 07:45:14,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156516789982926
[2023-11-19 07:45:14,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 906 transitions.
[2023-11-19 07:45:14,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 906 transitions.
[2023-11-19 07:45:14,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:14,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 906 transitions.
[2023-11-19 07:45:14,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 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:45:14,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:14,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:14,118 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 367 flow. Second operand 7 states and 906 transitions.
[2023-11-19 07:45:14,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 182 transitions, 1716 flow
[2023-11-19 07:45:14,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 182 transitions, 1662 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-19 07:45:14,191 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 485 flow
[2023-11-19 07:45:14,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=65, PETRI_TRANSITIONS=61}
[2023-11-19 07:45:14,194 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places.
[2023-11-19 07:45:14,194 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 485 flow
[2023-11-19 07:45:14,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 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:45:14,195 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:14,195 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]
[2023-11-19 07:45:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:45:14,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:14,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1843958329, now seen corresponding path program 1 times
[2023-11-19 07:45:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8645293]
[2023-11-19 07:45:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:14,466 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:45:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8645293]
[2023-11-19 07:45:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8645293] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:14,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:45:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215539214]
[2023-11-19 07:45:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:14,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:14,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251
[2023-11-19 07:45:14,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 485 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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:45:14,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:14,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251
[2023-11-19 07:45:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:16,137 INFO L124 PetriNetUnfolderBase]: 9624/14683 cut-off events.
[2023-11-19 07:45:16,137 INFO L125 PetriNetUnfolderBase]: For 53991/53991 co-relation queries the response was YES.
[2023-11-19 07:45:16,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69720 conditions, 14683 events. 9624/14683 cut-off events. For 53991/53991 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 93866 event pairs, 1869 based on Foata normal form. 39/14722 useless extension candidates. Maximal degree in co-relation 69691. Up to 7252 conditions per place.
[2023-11-19 07:45:16,212 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 77 selfloop transitions, 21 changer transitions 34/132 dead transitions.
[2023-11-19 07:45:16,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 1280 flow
[2023-11-19 07:45:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:45:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:45:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions.
[2023-11-19 07:45:16,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049800796812749
[2023-11-19 07:45:16,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions.
[2023-11-19 07:45:16,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions.
[2023-11-19 07:45:16,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:16,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions.
[2023-11-19 07:45:16,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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:45:16,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:16,222 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:16,222 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 485 flow. Second operand 4 states and 507 transitions.
[2023-11-19 07:45:16,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 1280 flow
[2023-11-19 07:45:17,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1140 flow, removed 51 selfloop flow, removed 3 redundant places.
[2023-11-19 07:45:17,651 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 513 flow
[2023-11-19 07:45:17,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=67, PETRI_TRANSITIONS=59}
[2023-11-19 07:45:17,652 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places.
[2023-11-19 07:45:17,653 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 513 flow
[2023-11-19 07:45:17,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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:45:17,653 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:17,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]
[2023-11-19 07:45:17,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:45:17,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:17,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1906885984, now seen corresponding path program 1 times
[2023-11-19 07:45:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626305810]
[2023-11-19 07:45:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:17,962 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:45:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626305810]
[2023-11-19 07:45:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626305810] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:45:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781409053]
[2023-11-19 07:45:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:17,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:45:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:17,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:45:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:45:17,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251
[2023-11-19 07:45:17,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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:45:17,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:17,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251
[2023-11-19 07:45:17,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:18,985 INFO L124 PetriNetUnfolderBase]: 3573/5884 cut-off events.
[2023-11-19 07:45:18,985 INFO L125 PetriNetUnfolderBase]: For 25404/25518 co-relation queries the response was YES.
[2023-11-19 07:45:19,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25499 conditions, 5884 events. 3573/5884 cut-off events. For 25404/25518 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 37173 event pairs, 394 based on Foata normal form. 410/6211 useless extension candidates. Maximal degree in co-relation 25468. Up to 1863 conditions per place.
[2023-11-19 07:45:19,010 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 112 selfloop transitions, 17 changer transitions 52/187 dead transitions.
[2023-11-19 07:45:19,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 187 transitions, 2007 flow
[2023-11-19 07:45:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:45:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:45:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions.
[2023-11-19 07:45:19,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173591348890154
[2023-11-19 07:45:19,014 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions.
[2023-11-19 07:45:19,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions.
[2023-11-19 07:45:19,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:19,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions.
[2023-11-19 07:45:19,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 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:45:19,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:19,022 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:19,022 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 513 flow. Second operand 7 states and 909 transitions.
[2023-11-19 07:45:19,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 187 transitions, 2007 flow
[2023-11-19 07:45:19,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 187 transitions, 1969 flow, removed 19 selfloop flow, removed 3 redundant places.
[2023-11-19 07:45:19,099 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 585 flow
[2023-11-19 07:45:19,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=69, PETRI_TRANSITIONS=63}
[2023-11-19 07:45:19,100 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places.
[2023-11-19 07:45:19,100 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 585 flow
[2023-11-19 07:45:19,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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:45:19,101 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:19,101 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]
[2023-11-19 07:45:19,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:45:19,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:19,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -522570972, now seen corresponding path program 1 times
[2023-11-19 07:45:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769585005]
[2023-11-19 07:45:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:19,425 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:45:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769585005]
[2023-11-19 07:45:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769585005] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:45:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519450258]
[2023-11-19 07:45:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:19,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:45:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:19,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:45:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:45:19,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251
[2023-11-19 07:45:19,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 585 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 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:45:19,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:19,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251
[2023-11-19 07:45:19,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:20,330 INFO L124 PetriNetUnfolderBase]: 2646/4494 cut-off events.
[2023-11-19 07:45:20,330 INFO L125 PetriNetUnfolderBase]: For 20508/20591 co-relation queries the response was YES.
[2023-11-19 07:45:20,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21189 conditions, 4494 events. 2646/4494 cut-off events. For 20508/20591 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 28349 event pairs, 340 based on Foata normal form. 75/4505 useless extension candidates. Maximal degree in co-relation 21156. Up to 1459 conditions per place.
[2023-11-19 07:45:20,349 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 77 selfloop transitions, 22 changer transitions 65/168 dead transitions.
[2023-11-19 07:45:20,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 168 transitions, 1822 flow
[2023-11-19 07:45:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:45:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:45:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1139 transitions.
[2023-11-19 07:45:20,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042054006197433
[2023-11-19 07:45:20,354 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1139 transitions.
[2023-11-19 07:45:20,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1139 transitions.
[2023-11-19 07:45:20,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:20,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1139 transitions.
[2023-11-19 07:45:20,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.55555555555556) internal successors, (1139), 9 states have internal predecessors, (1139), 0 states have call successors, (0), 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:45:20,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 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:45:20,365 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 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:45:20,365 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 585 flow. Second operand 9 states and 1139 transitions.
[2023-11-19 07:45:20,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 168 transitions, 1822 flow
[2023-11-19 07:45:20,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 168 transitions, 1721 flow, removed 26 selfloop flow, removed 5 redundant places.
[2023-11-19 07:45:20,656 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 418 flow
[2023-11-19 07:45:20,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=75, PETRI_TRANSITIONS=51}
[2023-11-19 07:45:20,656 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places.
[2023-11-19 07:45:20,657 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 418 flow
[2023-11-19 07:45:20,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 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:45:20,657 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:20,657 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, 1, 1]
[2023-11-19 07:45:20,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:45:20,657 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:20,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 908468544, now seen corresponding path program 1 times
[2023-11-19 07:45:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54375907]
[2023-11-19 07:45:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:20,994 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:45:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54375907]
[2023-11-19 07:45:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54375907] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:45:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472857034]
[2023-11-19 07:45:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:20,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:21,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251
[2023-11-19 07:45:21,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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:45:21,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:21,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251
[2023-11-19 07:45:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:21,291 INFO L124 PetriNetUnfolderBase]: 590/1016 cut-off events.
[2023-11-19 07:45:21,291 INFO L125 PetriNetUnfolderBase]: For 3249/3249 co-relation queries the response was YES.
[2023-11-19 07:45:21,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 1016 events. 590/1016 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4326 event pairs, 82 based on Foata normal form. 1/1017 useless extension candidates. Maximal degree in co-relation 4581. Up to 604 conditions per place.
[2023-11-19 07:45:21,298 INFO L140 encePairwiseOnDemand]: 240/251 looper letters, 63 selfloop transitions, 16 changer transitions 19/98 dead transitions.
[2023-11-19 07:45:21,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 945 flow
[2023-11-19 07:45:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:45:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:45:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions.
[2023-11-19 07:45:21,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47729083665338645
[2023-11-19 07:45:21,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions.
[2023-11-19 07:45:21,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions.
[2023-11-19 07:45:21,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:21,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions.
[2023-11-19 07:45:21,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 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:45:21,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:45:21,310 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:45:21,310 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 418 flow. Second operand 5 states and 599 transitions.
[2023-11-19 07:45:21,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 945 flow
[2023-11-19 07:45:21,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 718 flow, removed 60 selfloop flow, removed 16 redundant places.
[2023-11-19 07:45:21,327 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 382 flow
[2023-11-19 07:45:21,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=63, PETRI_TRANSITIONS=55}
[2023-11-19 07:45:21,328 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places.
[2023-11-19 07:45:21,328 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 382 flow
[2023-11-19 07:45:21,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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:45:21,329 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:21,329 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, 1, 1]
[2023-11-19 07:45:21,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:45:21,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:21,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash 142346322, now seen corresponding path program 2 times
[2023-11-19 07:45:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154219250]
[2023-11-19 07:45:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:21,597 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:45:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154219250]
[2023-11-19 07:45:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154219250] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:21,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:45:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333342095]
[2023-11-19 07:45:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:21,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:45:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:45:21,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:45:21,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 251
[2023-11-19 07:45:21,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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:45:21,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:21,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 251
[2023-11-19 07:45:21,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:21,836 INFO L124 PetriNetUnfolderBase]: 506/899 cut-off events.
[2023-11-19 07:45:21,836 INFO L125 PetriNetUnfolderBase]: For 2112/2136 co-relation queries the response was YES.
[2023-11-19 07:45:21,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 899 events. 506/899 cut-off events. For 2112/2136 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3912 event pairs, 124 based on Foata normal form. 5/900 useless extension candidates. Maximal degree in co-relation 3726. Up to 490 conditions per place.
[2023-11-19 07:45:21,841 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 38 selfloop transitions, 1 changer transitions 47/87 dead transitions.
[2023-11-19 07:45:21,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 730 flow
[2023-11-19 07:45:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:45:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:45:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions.
[2023-11-19 07:45:21,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189243027888446
[2023-11-19 07:45:21,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions.
[2023-11-19 07:45:21,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions.
[2023-11-19 07:45:21,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:21,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions.
[2023-11-19 07:45:21,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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:45:21,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:21,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:45:21,850 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 382 flow. Second operand 4 states and 521 transitions.
[2023-11-19 07:45:21,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 730 flow
[2023-11-19 07:45:21,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 720 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-11-19 07:45:21,863 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 229 flow
[2023-11-19 07:45:21,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=62, PETRI_TRANSITIONS=38}
[2023-11-19 07:45:21,864 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places.
[2023-11-19 07:45:21,865 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 229 flow
[2023-11-19 07:45:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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:45:21,865 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:21,866 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, 1, 1]
[2023-11-19 07:45:21,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:45:21,866 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:21,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1159723826, now seen corresponding path program 3 times
[2023-11-19 07:45:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233616246]
[2023-11-19 07:45:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:45:23,849 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:45:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:45:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233616246]
[2023-11-19 07:45:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233616246] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:45:23,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:45:23,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:45:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271372879]
[2023-11-19 07:45:23,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:45:23,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-19 07:45:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:45:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-19 07:45:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:45:23,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251
[2023-11-19 07:45:23,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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:45:23,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:45:23,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251
[2023-11-19 07:45:23,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:45:24,340 INFO L124 PetriNetUnfolderBase]: 118/242 cut-off events.
[2023-11-19 07:45:24,340 INFO L125 PetriNetUnfolderBase]: For 758/773 co-relation queries the response was YES.
[2023-11-19 07:45:24,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 242 events. 118/242 cut-off events. For 758/773 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 828 event pairs, 16 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 1021. Up to 111 conditions per place.
[2023-11-19 07:45:24,341 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 41 selfloop transitions, 4 changer transitions 24/71 dead transitions.
[2023-11-19 07:45:24,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 586 flow
[2023-11-19 07:45:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:45:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:45:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions.
[2023-11-19 07:45:24,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809334092202618
[2023-11-19 07:45:24,346 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions.
[2023-11-19 07:45:24,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions.
[2023-11-19 07:45:24,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:45:24,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions.
[2023-11-19 07:45:24,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 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:45:24,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:24,355 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:45:24,355 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 229 flow. Second operand 7 states and 845 transitions.
[2023-11-19 07:45:24,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 586 flow
[2023-11-19 07:45:24,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 486 flow, removed 8 selfloop flow, removed 14 redundant places.
[2023-11-19 07:45:24,359 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 182 flow
[2023-11-19 07:45:24,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=38}
[2023-11-19 07:45:24,360 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2023-11-19 07:45:24,360 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 182 flow
[2023-11-19 07:45:24,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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:45:24,361 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:45:24,362 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, 1, 1]
[2023-11-19 07:45:24,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:45:24,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:45:24,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:45:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1190125684, now seen corresponding path program 4 times
[2023-11-19 07:45:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:45:24,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047382486]
[2023-11-19 07:45:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:45:24,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:45:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:45:24,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:45:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:45:24,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:45:24,565 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:45:24,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-19 07:45:24,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-19 07:45:24,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-19 07:45:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-19 07:45:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-19 07:45:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-19 07:45:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-19 07:45:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-19 07:45:24,571 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:45:24,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:45:24,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:45:24,663 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:45:24,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:45:24,671 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:45:24,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated
[2023-11-19 07:45:24,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:24 BasicIcfg
[2023-11-19 07:45:24,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:45:24,715 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:45:24,715 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:45:24,715 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:45:24,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:51" (3/4) ...
[2023-11-19 07:45:24,717 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:45:24,751 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:45:24,756 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:45:24,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:45:24,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated
[2023-11-19 07:45:24,847 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:45:24,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:45:24,852 INFO L158 Benchmark]: Toolchain (without parser) took 35668.99ms. Allocated memory was 134.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 101.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,853 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 100.7MB. Free memory was 51.9MB in the beginning and 51.7MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:45:24,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.62ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 76.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.37ms. Allocated memory is still 134.2MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,854 INFO L158 Benchmark]: Boogie Preprocessor took 67.62ms. Allocated memory is still 134.2MB. Free memory was 74.1MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,854 INFO L158 Benchmark]: RCFGBuilder took 1001.40ms. Allocated memory is still 134.2MB. Free memory was 71.7MB in the beginning and 77.0MB in the end (delta: -5.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,855 INFO L158 Benchmark]: TraceAbstraction took 33605.95ms. Allocated memory was 134.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 76.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,855 INFO L158 Benchmark]: Witness Printer took 132.04ms. Allocated memory is still 2.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2023-11-19 07:45:24,857 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.36ms. Allocated memory is still 100.7MB. Free memory was 51.9MB in the beginning and 51.7MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 745.62ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 76.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 108.37ms. Allocated memory is still 134.2MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 67.62ms. Allocated memory is still 134.2MB. Free memory was 74.1MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1001.40ms. Allocated memory is still 134.2MB. Free memory was 71.7MB in the beginning and 77.0MB in the end (delta: -5.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 33605.95ms. Allocated memory was 134.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 76.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB.
* Witness Printer took 132.04ms. Allocated memory is still 2.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre13 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: 4.9s, 142 PlacesBefore, 41 PlacesAfterwards, 131 TransitionsBefore, 29 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 7603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3793, independent: 3603, independent conditional: 0, independent unconditional: 3603, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1910, independent: 1870, independent conditional: 0, independent unconditional: 1870, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3793, independent: 1733, independent conditional: 0, independent unconditional: 1733, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1910, unknown conditional: 0, unknown unconditional: 1910] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p2_EAX = 0;
[L714] 0 int __unbuffered_p2_EBX = 0;
[L716] 0 int __unbuffered_p3_EAX = 0;
[L718] 0 int __unbuffered_p3_EBX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool main$tmp_guard0;
[L722] 0 _Bool main$tmp_guard1;
[L724] 0 int x = 0;
[L726] 0 int y = 0;
[L728] 0 int z = 0;
[L729] 0 _Bool z$flush_delayed;
[L730] 0 int z$mem_tmp;
[L731] 0 _Bool z$r_buff0_thd0;
[L732] 0 _Bool z$r_buff0_thd1;
[L733] 0 _Bool z$r_buff0_thd2;
[L734] 0 _Bool z$r_buff0_thd3;
[L735] 0 _Bool z$r_buff0_thd4;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$r_buff1_thd4;
[L741] 0 _Bool z$read_delayed;
[L742] 0 int *z$read_delayed_var;
[L743] 0 int z$w_buff0;
[L744] 0 _Bool z$w_buff0_used;
[L745] 0 int z$w_buff1;
[L746] 0 _Bool z$w_buff1_used;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L867] 0 pthread_t t213;
[L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L869] 0 pthread_t t214;
[L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L871] 0 pthread_t t215;
[L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L873] 0 pthread_t t216;
[L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L813] 4 z$w_buff1 = z$w_buff0
[L814] 4 z$w_buff0 = 1
[L815] 4 z$w_buff1_used = z$w_buff0_used
[L816] 4 z$w_buff0_used = (_Bool)1
[L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 4 !(!expression)
[L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L823] 4 z$r_buff0_thd4 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L826] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 4 z$flush_delayed = weak$$choice2
[L829] 4 z$mem_tmp = z
[L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] 4 __unbuffered_p3_EAX = z
[L838] 4 z = z$flush_delayed ? z$mem_tmp : z
[L839] 4 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L842] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L752] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L767] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L770] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L782] 3 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L785] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L788] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L789] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L790] 3 z$flush_delayed = weak$$choice2
[L791] 3 z$mem_tmp = z
[L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799] 3 __unbuffered_p2_EBX = z
[L800] 3 z = z$flush_delayed ? z$mem_tmp : z
[L801] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L854] 4 return 0;
[L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L762] 1 return 0;
[L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L777] 2 return 0;
[L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L808] 3 return 0;
[L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L878] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L878] RET 0 assume_abort_if_not(main$tmp_guard0)
[L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L889] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 870]: 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: 874]: 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: 868]: 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: 872]: 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 9 procedures, 173 locations, 7 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: 33.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 714 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1597 IncrementalHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 83 mSDtfsCounter, 1597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=585occurred in iteration=10, InterpolantAutomatonStates: 68, 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.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:45:24,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba89cfb-c515-4c78-a256-7ecb5e55dff7/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