/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:02:30,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:02:30,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:02:30,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:02:30,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:02:30,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:02:30,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:02:30,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:02:30,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:02:30,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:02:30,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:02:30,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:02:30,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:02:30,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:02:30,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:02:30,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:02:30,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:02:30,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:02:30,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:02:30,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:02:30,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:02:30,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:02:30,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:02:30,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:02:30,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:02:30,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:02:30,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:02:30,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:02:30,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:02:30,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:02:30,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:02:30,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:02:30,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:02:30,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:02:30,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:02:30,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:02:30,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:02:30,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:02:30,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:02:30,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:02:30,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:02:30,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:02:30,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:02:30,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:02:30,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:02:30,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:02:30,697 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:02:30,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:02:30,697 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:02:30,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:02:30,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:02:30,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:02:30,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:02:30,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:02:30,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:02:30,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:02:30,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:02:30,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:02:30,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:02:30,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:02:30,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:02:30,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:02:30,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:02:30,701 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:02:30,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:02:30,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:02:30,701 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2021-03-26 10:02:30,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:02:31,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:02:31,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:02:31,026 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:02:31,027 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:02:31,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-03-26 10:02:31,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b494380da/9c7eccb792714347bbc57c5f4ef9d723/FLAG4201204a6 [2021-03-26 10:02:31,544 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:02:31,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-03-26 10:02:31,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b494380da/9c7eccb792714347bbc57c5f4ef9d723/FLAG4201204a6 [2021-03-26 10:02:31,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b494380da/9c7eccb792714347bbc57c5f4ef9d723 [2021-03-26 10:02:31,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:02:31,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:02:31,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:02:31,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:02:31,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:02:31,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:02:31" (1/1) ... [2021-03-26 10:02:31,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de5d3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:31, skipping insertion in model container [2021-03-26 10:02:31,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:02:31" (1/1) ... [2021-03-26 10:02:31,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:02:31,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:02:31,988 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i[948,961] [2021-03-26 10:02:32,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:02:32,192 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:02:32,205 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i[948,961] [2021-03-26 10:02:32,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:02:32,361 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:02:32,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32 WrapperNode [2021-03-26 10:02:32,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:02:32,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:02:32,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:02:32,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:02:32,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:02:32,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:02:32,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:02:32,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:02:32,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... [2021-03-26 10:02:32,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:02:32,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:02:32,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:02:32,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:02:32,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:02:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:02:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:02:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:02:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:02:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:02:32,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:02:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:02:32,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:02:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:02:32,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:02:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:02:32,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:02:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:02:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:02:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:02:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:02:32,565 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:02:34,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:02:34,485 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:02:34,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:02:34 BoogieIcfgContainer [2021-03-26 10:02:34,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:02:34,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:02:34,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:02:34,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:02:34,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:02:31" (1/3) ... [2021-03-26 10:02:34,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7330a5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:02:34, skipping insertion in model container [2021-03-26 10:02:34,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:32" (2/3) ... [2021-03-26 10:02:34,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7330a5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:02:34, skipping insertion in model container [2021-03-26 10:02:34,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:02:34" (3/3) ... [2021-03-26 10:02:34,495 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2021-03-26 10:02:34,502 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:02:34,506 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:02:34,507 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:02:34,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,551 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,551 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,557 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,557 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,579 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:02:34,588 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:02:34,604 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:02:34,632 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:02:34,632 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:02:34,632 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:02:34,633 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:02:34,633 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:02:34,633 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:02:34,633 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:02:34,633 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:02:34,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:02:34,687 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:02:34,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:02:34,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:02:34,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:02:34,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 10:02:34,697 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:34,709 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:02:34,711 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:02:34,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 10:02:34,732 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:02:34,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:02:34,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 10:02:34,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 2766 [2021-03-26 10:02:35,954 WARN L205 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 10:02:36,270 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:02:37,891 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-26 10:02:38,515 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:02:39,577 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:02:39,946 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:02:40,060 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:02:41,974 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-26 10:02:42,257 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:02:42,864 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:02:43,447 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:02:43,915 INFO L154 LiptonReduction]: Checked pairs total: 5586 [2021-03-26 10:02:43,915 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-26 10:02:43,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9221 [2021-03-26 10:02:43,928 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 10:02:43,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:02:43,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:43,929 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:43,929 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2055766290, now seen corresponding path program 1 times [2021-03-26 10:02:43,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:43,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256643151] [2021-03-26 10:02:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:44,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:44,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:44,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:44,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:44,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256643151] [2021-03-26 10:02:44,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:44,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:02:44,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013283267] [2021-03-26 10:02:44,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:02:44,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:44,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:02:44,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:02:44,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2021-03-26 10:02:44,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:44,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:44,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2021-03-26 10:02:44,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:44,384 INFO L129 PetriNetUnfolder]: 185/433 cut-off events. [2021-03-26 10:02:44,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:02:44,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 433 events. 185/433 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2448 event pairs, 123 based on Foata normal form. 20/411 useless extension candidates. Maximal degree in co-relation 709. Up to 209 conditions per place. [2021-03-26 10:02:44,394 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 11 selfloop transitions, 2 changer transitions 5/48 dead transitions. [2021-03-26 10:02:44,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 138 flow [2021-03-26 10:02:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:02:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:02:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2021-03-26 10:02:44,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2021-03-26 10:02:44,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2021-03-26 10:02:44,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2021-03-26 10:02:44,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:44,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2021-03-26 10:02:44,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:44,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:44,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:44,440 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 528 transitions. [2021-03-26 10:02:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 138 flow [2021-03-26 10:02:44,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:02:44,445 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 88 flow [2021-03-26 10:02:44,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-26 10:02:44,447 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:02:44,447 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:44,448 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-26 10:02:44,448 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-26 10:02:44,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 88 flow [2021-03-26 10:02:44,454 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 10:02:44,454 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:02:44,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:02:44,457 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 10:02:45,284 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 190 [2021-03-26 10:02:45,587 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 10:02:46,186 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:02:46,860 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:02:47,691 INFO L154 LiptonReduction]: Checked pairs total: 1748 [2021-03-26 10:02:47,691 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:02:47,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3245 [2021-03-26 10:02:47,693 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 10:02:47,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:47,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:47,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:47,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:02:47,694 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2048186142, now seen corresponding path program 1 times [2021-03-26 10:02:47,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:47,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106692392] [2021-03-26 10:02:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:47,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:47,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:47,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:47,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:47,825 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:02:47,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:02:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:47,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106692392] [2021-03-26 10:02:47,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:47,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:47,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310881078] [2021-03-26 10:02:47,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:47,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:47,832 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2021-03-26 10:02:47,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:47,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:47,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2021-03-26 10:02:47,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:47,856 INFO L129 PetriNetUnfolder]: 7/53 cut-off events. [2021-03-26 10:02:47,856 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:02:47,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 53 events. 7/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 3 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 73. Up to 18 conditions per place. [2021-03-26 10:02:47,857 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 4 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 10:02:47,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 92 flow [2021-03-26 10:02:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:02:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:02:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2021-03-26 10:02:47,859 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8938640132669984 [2021-03-26 10:02:47,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2021-03-26 10:02:47,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2021-03-26 10:02:47,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:47,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2021-03-26 10:02:47,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:47,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:47,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:47,863 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 539 transitions. [2021-03-26 10:02:47,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 92 flow [2021-03-26 10:02:47,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:02:47,864 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2021-03-26 10:02:47,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 10:02:47,865 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-26 10:02:47,865 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:47,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-26 10:02:47,865 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-26 10:02:47,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 89 flow [2021-03-26 10:02:47,871 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2021-03-26 10:02:47,871 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:02:47,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 41 events. 3/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-26 10:02:47,872 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-26 10:02:48,417 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:02:48,563 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:02:48,874 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:02:49,024 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:02:49,029 INFO L154 LiptonReduction]: Checked pairs total: 1590 [2021-03-26 10:02:49,029 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:02:49,030 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1165 [2021-03-26 10:02:49,031 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2021-03-26 10:02:49,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:49,031 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:49,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:02:49,032 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash 432543156, now seen corresponding path program 1 times [2021-03-26 10:02:49,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:49,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698833374] [2021-03-26 10:02:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:49,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:49,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:49,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698833374] [2021-03-26 10:02:49,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:49,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:02:49,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528381204] [2021-03-26 10:02:49,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:02:49,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:49,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:02:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:02:49,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 203 [2021-03-26 10:02:49,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:49,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 203 [2021-03-26 10:02:49,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:49,146 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-26 10:02:49,146 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 10:02:49,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 37 events. 2/37 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 54. Up to 8 conditions per place. [2021-03-26 10:02:49,147 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-03-26 10:02:49,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 91 flow [2021-03-26 10:02:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:02:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:02:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 10:02:49,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981937602627258 [2021-03-26 10:02:49,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 10:02:49,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 10:02:49,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:49,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 10:02:49,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,155 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 3 states and 547 transitions. [2021-03-26 10:02:49,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 91 flow [2021-03-26 10:02:49,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:02:49,157 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 90 flow [2021-03-26 10:02:49,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 10:02:49,157 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-26 10:02:49,157 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:49,157 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-26 10:02:49,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-26 10:02:49,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 90 flow [2021-03-26 10:02:49,166 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-26 10:02:49,166 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:02:49,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 2/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 52. Up to 8 conditions per place. [2021-03-26 10:02:49,168 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-26 10:02:49,343 INFO L154 LiptonReduction]: Checked pairs total: 512 [2021-03-26 10:02:49,344 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:49,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 187 [2021-03-26 10:02:49,347 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 90 flow [2021-03-26 10:02:49,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:49,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:49,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:02:49,348 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 619953064, now seen corresponding path program 1 times [2021-03-26 10:02:49,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:49,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859212902] [2021-03-26 10:02:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:49,462 INFO L142 QuantifierPusher]: treesize reduction 10, result has 66.7 percent of original size [2021-03-26 10:02:49,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:02:49,476 INFO L142 QuantifierPusher]: treesize reduction 14, result has 62.2 percent of original size [2021-03-26 10:02:49,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:02:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:49,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859212902] [2021-03-26 10:02:49,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:49,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:02:49,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052843907] [2021-03-26 10:02:49,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:49,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:49,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 203 [2021-03-26 10:02:49,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:49,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 203 [2021-03-26 10:02:49,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:49,646 INFO L129 PetriNetUnfolder]: 277/491 cut-off events. [2021-03-26 10:02:49,646 INFO L130 PetriNetUnfolder]: For 131/201 co-relation queries the response was YES. [2021-03-26 10:02:49,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 491 events. 277/491 cut-off events. For 131/201 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2470 event pairs, 183 based on Foata normal form. 7/450 useless extension candidates. Maximal degree in co-relation 1009. Up to 385 conditions per place. [2021-03-26 10:02:49,651 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 10 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2021-03-26 10:02:49,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 152 flow [2021-03-26 10:02:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:02:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:02:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2021-03-26 10:02:49,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8004926108374384 [2021-03-26 10:02:49,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2021-03-26 10:02:49,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2021-03-26 10:02:49,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:49,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2021-03-26 10:02:49,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,659 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,659 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 90 flow. Second operand 4 states and 650 transitions. [2021-03-26 10:02:49,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 152 flow [2021-03-26 10:02:49,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:02:49,662 INFO L241 Difference]: Finished difference. Result has 46 places, 40 transitions, 151 flow [2021-03-26 10:02:49,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2021-03-26 10:02:49,663 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2021-03-26 10:02:49,663 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:49,663 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 151 flow [2021-03-26 10:02:49,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 151 flow [2021-03-26 10:02:49,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 151 flow [2021-03-26 10:02:49,721 INFO L129 PetriNetUnfolder]: 39/142 cut-off events. [2021-03-26 10:02:49,722 INFO L130 PetriNetUnfolder]: For 140/172 co-relation queries the response was YES. [2021-03-26 10:02:49,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 142 events. 39/142 cut-off events. For 140/172 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 726 event pairs, 10 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 307. Up to 51 conditions per place. [2021-03-26 10:02:49,725 INFO L142 LiptonReduction]: Number of co-enabled transitions 686 [2021-03-26 10:02:49,874 INFO L154 LiptonReduction]: Checked pairs total: 437 [2021-03-26 10:02:49,874 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:49,874 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 211 [2021-03-26 10:02:49,875 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 151 flow [2021-03-26 10:02:49,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:49,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:49,877 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:49,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:02:49,878 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash 903605831, now seen corresponding path program 1 times [2021-03-26 10:02:49,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:49,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685832413] [2021-03-26 10:02:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:49,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:49,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:02:49,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:49,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:02:50,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:02:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:50,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685832413] [2021-03-26 10:02:50,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:50,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:50,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88158088] [2021-03-26 10:02:50,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:02:50,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:02:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:02:50,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 203 [2021-03-26 10:02:50,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:50,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 203 [2021-03-26 10:02:50,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:50,207 INFO L129 PetriNetUnfolder]: 287/536 cut-off events. [2021-03-26 10:02:50,207 INFO L130 PetriNetUnfolder]: For 812/1850 co-relation queries the response was YES. [2021-03-26 10:02:50,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 536 events. 287/536 cut-off events. For 812/1850 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2791 event pairs, 60 based on Foata normal form. 46/531 useless extension candidates. Maximal degree in co-relation 1435. Up to 324 conditions per place. [2021-03-26 10:02:50,213 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 22 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2021-03-26 10:02:50,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 282 flow [2021-03-26 10:02:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:02:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:02:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2021-03-26 10:02:50,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7940886699507389 [2021-03-26 10:02:50,216 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2021-03-26 10:02:50,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2021-03-26 10:02:50,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:50,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2021-03-26 10:02:50,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,221 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,221 INFO L185 Difference]: Start difference. First operand has 46 places, 40 transitions, 151 flow. Second operand 5 states and 806 transitions. [2021-03-26 10:02:50,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 282 flow [2021-03-26 10:02:50,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:02:50,228 INFO L241 Difference]: Finished difference. Result has 53 places, 47 transitions, 234 flow [2021-03-26 10:02:50,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2021-03-26 10:02:50,228 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:02:50,228 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:50,228 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 234 flow [2021-03-26 10:02:50,229 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 234 flow [2021-03-26 10:02:50,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 234 flow [2021-03-26 10:02:50,275 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L804-->L811: Formula: (let ((.cse13 (= (mod v_~x$w_buff0_used~0_436 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd3~0_50 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_330 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_435 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_68 256) 0))) (let ((.cse0 (or .cse8 .cse12)) (.cse2 (not .cse14)) (.cse1 (or .cse10 .cse14)) (.cse6 (or .cse13 .cse12)) (.cse7 (not .cse13)) (.cse4 (not .cse12)) (.cse5 (not .cse8)) (.cse3 (not .cse10))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_330 v_~x$w_buff1_used~0_329)) (and (= v_~x$w_buff1_used~0_329 0) (or (and .cse2 .cse3) (and .cse4 .cse5)))) (or (and .cse0 (= v_~x$r_buff0_thd3~0_68 v_~x$r_buff0_thd3~0_67)) (and (= v_~x$r_buff0_thd3~0_67 0) .cse4 .cse5)) (or (and .cse6 (= v_~x$w_buff0_used~0_436 v_~x$w_buff0_used~0_435)) (and (= v_~x$w_buff0_used~0_435 0) .cse7 .cse4)) (or (and (or (and (= |v_P2_#t~ite17_49| v_~x$w_buff1~0_80) .cse2 .cse3) (and .cse1 (= |v_P2_#t~ite17_49| v_~x~0_144))) (= |v_P2_#t~ite17_49| v_~x~0_143) .cse6) (and (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse7 .cse4 (= v_~x~0_143 v_~x$w_buff0~0_85))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_67 256) 0)) (.cse11 (= (mod v_~x$w_buff1_used~0_329 256) 0))) (or (and (or .cse8 .cse9) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff1_thd3~0_50) (or .cse10 .cse11)) (and (or (and (not .cse9) .cse5) (and .cse3 (not .cse11))) (= v_~x$r_buff1_thd3~0_49 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_330, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_68, ~x~0=v_~x~0_144, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_329, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~x~0=v_~x~0_143, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, P2Thread1of1ForFork3_#t~ite20, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, P2Thread1of1ForFork3_#t~ite17, ~x$w_buff0_used~0, P2Thread1of1ForFork3_#t~ite18][5], [Black: 156#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0)), 33#L754true, Black: 157#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 158#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), P2Thread1of1ForFork3InUse, 100#L791true, 42#L834true, Black: 138#(= ~z~0 0), 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 144#(= ~__unbuffered_p3_EAX~0 0), 147#true, 86#L811true, Black: 149#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= 2 ~x$w_buff1~0)) (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0)), Black: 150#(and (or (and (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0)) (and (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 154#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse]) [2021-03-26 10:02:50,275 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 10:02:50,275 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:02:50,275 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:02:50,275 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:02:50,276 INFO L129 PetriNetUnfolder]: 142/322 cut-off events. [2021-03-26 10:02:50,277 INFO L130 PetriNetUnfolder]: For 761/930 co-relation queries the response was YES. [2021-03-26 10:02:50,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 322 events. 142/322 cut-off events. For 761/930 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1718 event pairs, 63 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 943. Up to 188 conditions per place. [2021-03-26 10:02:50,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 814 [2021-03-26 10:02:50,308 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-26 10:02:50,308 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:50,308 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-26 10:02:50,310 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 234 flow [2021-03-26 10:02:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,312 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:50,312 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:50,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:02:50,312 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash 450623202, now seen corresponding path program 1 times [2021-03-26 10:02:50,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:50,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238711504] [2021-03-26 10:02:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:50,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:02:50,422 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-26 10:02:50,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:02:50,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:02:50,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:02:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:50,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238711504] [2021-03-26 10:02:50,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:50,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:50,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901251508] [2021-03-26 10:02:50,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:02:50,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:50,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:02:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:02:50,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2021-03-26 10:02:50,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:50,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2021-03-26 10:02:50,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:50,669 INFO L129 PetriNetUnfolder]: 321/588 cut-off events. [2021-03-26 10:02:50,669 INFO L130 PetriNetUnfolder]: For 1543/3251 co-relation queries the response was YES. [2021-03-26 10:02:50,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 588 events. 321/588 cut-off events. For 1543/3251 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2992 event pairs, 59 based on Foata normal form. 47/583 useless extension candidates. Maximal degree in co-relation 2099. Up to 344 conditions per place. [2021-03-26 10:02:50,677 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 20 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2021-03-26 10:02:50,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 378 flow [2021-03-26 10:02:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:02:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:02:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 985 transitions. [2021-03-26 10:02:50,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8087027914614121 [2021-03-26 10:02:50,680 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 985 transitions. [2021-03-26 10:02:50,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 985 transitions. [2021-03-26 10:02:50,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:50,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 985 transitions. [2021-03-26 10:02:50,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,685 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,686 INFO L185 Difference]: Start difference. First operand has 53 places, 47 transitions, 234 flow. Second operand 6 states and 985 transitions. [2021-03-26 10:02:50,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 378 flow [2021-03-26 10:02:50,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 364 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:02:50,692 INFO L241 Difference]: Finished difference. Result has 58 places, 51 transitions, 299 flow [2021-03-26 10:02:50,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2021-03-26 10:02:50,692 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2021-03-26 10:02:50,692 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:50,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 51 transitions, 299 flow [2021-03-26 10:02:50,692 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 51 transitions, 299 flow [2021-03-26 10:02:50,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 299 flow [2021-03-26 10:02:50,737 INFO L129 PetriNetUnfolder]: 170/359 cut-off events. [2021-03-26 10:02:50,737 INFO L130 PetriNetUnfolder]: For 1132/1770 co-relation queries the response was YES. [2021-03-26 10:02:50,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 359 events. 170/359 cut-off events. For 1132/1770 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1849 event pairs, 29 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1335. Up to 218 conditions per place. [2021-03-26 10:02:50,743 INFO L142 LiptonReduction]: Number of co-enabled transitions 916 [2021-03-26 10:02:50,828 INFO L154 LiptonReduction]: Checked pairs total: 739 [2021-03-26 10:02:50,828 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:50,828 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-26 10:02:50,833 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 299 flow [2021-03-26 10:02:50,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:50,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:50,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:02:50,834 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 398250624, now seen corresponding path program 1 times [2021-03-26 10:02:50,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:50,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925554293] [2021-03-26 10:02:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:50,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:50,912 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:02:50,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:02:50,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:50,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:50,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925554293] [2021-03-26 10:02:50,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:50,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:50,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932680097] [2021-03-26 10:02:50,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:50,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:50,922 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 10:02:50,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:50,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:50,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 10:02:50,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:51,143 INFO L129 PetriNetUnfolder]: 725/1399 cut-off events. [2021-03-26 10:02:51,143 INFO L130 PetriNetUnfolder]: For 2962/3687 co-relation queries the response was YES. [2021-03-26 10:02:51,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4012 conditions, 1399 events. 725/1399 cut-off events. For 2962/3687 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 9718 event pairs, 247 based on Foata normal form. 91/1231 useless extension candidates. Maximal degree in co-relation 3991. Up to 780 conditions per place. [2021-03-26 10:02:51,193 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 12 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2021-03-26 10:02:51,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 371 flow [2021-03-26 10:02:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:02:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:02:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2021-03-26 10:02:51,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8512315270935961 [2021-03-26 10:02:51,195 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2021-03-26 10:02:51,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2021-03-26 10:02:51,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:51,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2021-03-26 10:02:51,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,200 INFO L185 Difference]: Start difference. First operand has 58 places, 51 transitions, 299 flow. Second operand 5 states and 864 transitions. [2021-03-26 10:02:51,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 371 flow [2021-03-26 10:02:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 325 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-26 10:02:51,209 INFO L241 Difference]: Finished difference. Result has 60 places, 60 transitions, 328 flow [2021-03-26 10:02:51,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2021-03-26 10:02:51,209 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2021-03-26 10:02:51,209 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:51,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 328 flow [2021-03-26 10:02:51,210 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 328 flow [2021-03-26 10:02:51,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 328 flow [2021-03-26 10:02:51,353 INFO L129 PetriNetUnfolder]: 610/1174 cut-off events. [2021-03-26 10:02:51,353 INFO L130 PetriNetUnfolder]: For 2177/2837 co-relation queries the response was YES. [2021-03-26 10:02:51,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1174 events. 610/1174 cut-off events. For 2177/2837 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 8057 event pairs, 172 based on Foata normal form. 17/1039 useless extension candidates. Maximal degree in co-relation 3785. Up to 550 conditions per place. [2021-03-26 10:02:51,374 INFO L142 LiptonReduction]: Number of co-enabled transitions 1234 [2021-03-26 10:02:51,527 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 10:02:51,528 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:02:51,528 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 319 [2021-03-26 10:02:51,530 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 322 flow [2021-03-26 10:02:51,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,531 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:51,531 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:51,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:02:51,531 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2092787507, now seen corresponding path program 1 times [2021-03-26 10:02:51,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:51,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696165618] [2021-03-26 10:02:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:51,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:51,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:51,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:51,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:51,624 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:02:51,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:02:51,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:51,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:51,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696165618] [2021-03-26 10:02:51,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:51,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:02:51,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198830641] [2021-03-26 10:02:51,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:02:51,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:02:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:02:51,634 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 10:02:51,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:51,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 10:02:51,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:51,809 INFO L129 PetriNetUnfolder]: 468/967 cut-off events. [2021-03-26 10:02:51,810 INFO L130 PetriNetUnfolder]: For 1400/2378 co-relation queries the response was YES. [2021-03-26 10:02:51,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 967 events. 468/967 cut-off events. For 1400/2378 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6296 event pairs, 79 based on Foata normal form. 152/1006 useless extension candidates. Maximal degree in co-relation 3455. Up to 553 conditions per place. [2021-03-26 10:02:51,823 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 13 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2021-03-26 10:02:51,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 432 flow [2021-03-26 10:02:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:02:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:02:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1037 transitions. [2021-03-26 10:02:51,826 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8513957307060755 [2021-03-26 10:02:51,827 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1037 transitions. [2021-03-26 10:02:51,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1037 transitions. [2021-03-26 10:02:51,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:51,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1037 transitions. [2021-03-26 10:02:51,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:51,833 INFO L185 Difference]: Start difference. First operand has 60 places, 59 transitions, 322 flow. Second operand 6 states and 1037 transitions. [2021-03-26 10:02:51,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 432 flow [2021-03-26 10:02:51,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 425 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:02:51,840 INFO L241 Difference]: Finished difference. Result has 64 places, 64 transitions, 411 flow [2021-03-26 10:02:51,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2021-03-26 10:02:51,840 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 10:02:51,840 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:51,841 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 64 transitions, 411 flow [2021-03-26 10:02:51,841 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 411 flow [2021-03-26 10:02:51,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 411 flow [2021-03-26 10:02:51,931 INFO L129 PetriNetUnfolder]: 331/733 cut-off events. [2021-03-26 10:02:51,931 INFO L130 PetriNetUnfolder]: For 2066/2829 co-relation queries the response was YES. [2021-03-26 10:02:51,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 733 events. 331/733 cut-off events. For 2066/2829 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4772 event pairs, 48 based on Foata normal form. 28/700 useless extension candidates. Maximal degree in co-relation 2991. Up to 395 conditions per place. [2021-03-26 10:02:51,944 INFO L142 LiptonReduction]: Number of co-enabled transitions 1304 [2021-03-26 10:02:52,010 INFO L154 LiptonReduction]: Checked pairs total: 1092 [2021-03-26 10:02:52,010 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:02:52,010 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 170 [2021-03-26 10:02:52,010 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 403 flow [2021-03-26 10:02:52,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:52,011 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:52,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:02:52,011 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 651337310, now seen corresponding path program 1 times [2021-03-26 10:02:52,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:52,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356045276] [2021-03-26 10:02:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:52,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:52,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:52,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:52,092 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:02:52,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:02:52,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:52,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356045276] [2021-03-26 10:02:52,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:52,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:02:52,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767482613] [2021-03-26 10:02:52,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:02:52,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:02:52,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:02:52,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 10:02:52,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:52,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 10:02:52,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:52,261 INFO L129 PetriNetUnfolder]: 325/668 cut-off events. [2021-03-26 10:02:52,263 INFO L130 PetriNetUnfolder]: For 1861/2984 co-relation queries the response was YES. [2021-03-26 10:02:52,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 668 events. 325/668 cut-off events. For 1861/2984 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3783 event pairs, 33 based on Foata normal form. 143/714 useless extension candidates. Maximal degree in co-relation 2848. Up to 375 conditions per place. [2021-03-26 10:02:52,272 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 10 selfloop transitions, 18 changer transitions 4/75 dead transitions. [2021-03-26 10:02:52,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 559 flow [2021-03-26 10:02:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:02:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:02:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1210 transitions. [2021-03-26 10:02:52,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515130190007038 [2021-03-26 10:02:52,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1210 transitions. [2021-03-26 10:02:52,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1210 transitions. [2021-03-26 10:02:52,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:52,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1210 transitions. [2021-03-26 10:02:52,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,280 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,280 INFO L185 Difference]: Start difference. First operand has 64 places, 63 transitions, 403 flow. Second operand 7 states and 1210 transitions. [2021-03-26 10:02:52,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 559 flow [2021-03-26 10:02:52,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 497 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:02:52,289 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 463 flow [2021-03-26 10:02:52,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-26 10:02:52,289 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 10:02:52,289 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:52,289 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 463 flow [2021-03-26 10:02:52,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 463 flow [2021-03-26 10:02:52,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 463 flow [2021-03-26 10:02:52,333 INFO L129 PetriNetUnfolder]: 179/429 cut-off events. [2021-03-26 10:02:52,334 INFO L130 PetriNetUnfolder]: For 970/1252 co-relation queries the response was YES. [2021-03-26 10:02:52,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 429 events. 179/429 cut-off events. For 970/1252 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2411 event pairs, 4 based on Foata normal form. 3/394 useless extension candidates. Maximal degree in co-relation 1651. Up to 184 conditions per place. [2021-03-26 10:02:52,341 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-26 10:02:52,367 INFO L154 LiptonReduction]: Checked pairs total: 1173 [2021-03-26 10:02:52,367 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:02:52,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-26 10:02:52,368 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 453 flow [2021-03-26 10:02:52,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:52,368 INFO L263 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] [2021-03-26 10:02:52,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:02:52,369 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash 833500710, now seen corresponding path program 1 times [2021-03-26 10:02:52,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:52,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725246224] [2021-03-26 10:02:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:52,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:02:52,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:02:52,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:02:52,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:02:52,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:02:52,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:52,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:02:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:52,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725246224] [2021-03-26 10:02:52,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:52,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:02:52,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937056620] [2021-03-26 10:02:52,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:02:52,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:02:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:02:52,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 203 [2021-03-26 10:02:52,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 453 flow. Second operand has 8 states, 8 states have (on average 155.25) internal successors, (1242), 8 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:52,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2021-03-26 10:02:52,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:52,949 INFO L129 PetriNetUnfolder]: 483/1045 cut-off events. [2021-03-26 10:02:52,950 INFO L130 PetriNetUnfolder]: For 2277/2654 co-relation queries the response was YES. [2021-03-26 10:02:52,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1045 events. 483/1045 cut-off events. For 2277/2654 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6733 event pairs, 12 based on Foata normal form. 29/1009 useless extension candidates. Maximal degree in co-relation 4098. Up to 337 conditions per place. [2021-03-26 10:02:52,963 INFO L132 encePairwiseOnDemand]: 193/203 looper letters, 62 selfloop transitions, 34 changer transitions 1/129 dead transitions. [2021-03-26 10:02:52,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 129 transitions, 999 flow [2021-03-26 10:02:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:02:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:02:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1592 transitions. [2021-03-26 10:02:52,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7842364532019704 [2021-03-26 10:02:52,967 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1592 transitions. [2021-03-26 10:02:52,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1592 transitions. [2021-03-26 10:02:52,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:52,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1592 transitions. [2021-03-26 10:02:52,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 159.2) internal successors, (1592), 10 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,974 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:52,975 INFO L185 Difference]: Start difference. First operand has 67 places, 67 transitions, 453 flow. Second operand 10 states and 1592 transitions. [2021-03-26 10:02:52,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 129 transitions, 999 flow [2021-03-26 10:02:52,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 946 flow, removed 20 selfloop flow, removed 4 redundant places. [2021-03-26 10:02:52,991 INFO L241 Difference]: Finished difference. Result has 77 places, 89 transitions, 673 flow [2021-03-26 10:02:52,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=673, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2021-03-26 10:02:52,992 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2021-03-26 10:02:52,992 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:52,992 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 89 transitions, 673 flow [2021-03-26 10:02:52,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 89 transitions, 673 flow [2021-03-26 10:02:52,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 89 transitions, 673 flow [2021-03-26 10:02:53,093 INFO L129 PetriNetUnfolder]: 435/967 cut-off events. [2021-03-26 10:02:53,093 INFO L130 PetriNetUnfolder]: For 2080/2207 co-relation queries the response was YES. [2021-03-26 10:02:53,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3566 conditions, 967 events. 435/967 cut-off events. For 2080/2207 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6350 event pairs, 25 based on Foata normal form. 15/939 useless extension candidates. Maximal degree in co-relation 3536. Up to 336 conditions per place. [2021-03-26 10:02:53,111 INFO L142 LiptonReduction]: Number of co-enabled transitions 1440 [2021-03-26 10:02:53,202 INFO L154 LiptonReduction]: Checked pairs total: 608 [2021-03-26 10:02:53,202 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:53,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 210 [2021-03-26 10:02:53,204 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 673 flow [2021-03-26 10:02:53,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 155.25) internal successors, (1242), 8 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:53,204 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:53,204 INFO L263 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] [2021-03-26 10:02:53,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:02:53,205 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 26864968, now seen corresponding path program 2 times [2021-03-26 10:02:53,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:53,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794493545] [2021-03-26 10:02:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:53,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:53,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:53,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:53,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:53,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:53,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:53,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:53,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:53,302 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:02:53,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:02:53,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:53,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:53,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794493545] [2021-03-26 10:02:53,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:53,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:02:53,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453850500] [2021-03-26 10:02:53,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:02:53,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:02:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:02:53,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 10:02:53,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:53,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:53,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 10:02:53,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:53,565 INFO L129 PetriNetUnfolder]: 758/1486 cut-off events. [2021-03-26 10:02:53,566 INFO L130 PetriNetUnfolder]: For 2999/3955 co-relation queries the response was YES. [2021-03-26 10:02:53,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5619 conditions, 1486 events. 758/1486 cut-off events. For 2999/3955 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 9827 event pairs, 37 based on Foata normal form. 185/1469 useless extension candidates. Maximal degree in co-relation 5587. Up to 435 conditions per place. [2021-03-26 10:02:53,587 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 18 changer transitions 5/98 dead transitions. [2021-03-26 10:02:53,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 98 transitions, 787 flow [2021-03-26 10:02:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:02:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:02:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1375 transitions. [2021-03-26 10:02:53,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8466748768472906 [2021-03-26 10:02:53,591 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1375 transitions. [2021-03-26 10:02:53,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1375 transitions. [2021-03-26 10:02:53,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:53,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1375 transitions. [2021-03-26 10:02:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 171.875) internal successors, (1375), 8 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:53,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:53,597 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:53,597 INFO L185 Difference]: Start difference. First operand has 77 places, 89 transitions, 673 flow. Second operand 8 states and 1375 transitions. [2021-03-26 10:02:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 98 transitions, 787 flow [2021-03-26 10:02:53,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 739 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-26 10:02:53,627 INFO L241 Difference]: Finished difference. Result has 84 places, 90 transitions, 693 flow [2021-03-26 10:02:53,627 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=693, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2021-03-26 10:02:53,627 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2021-03-26 10:02:53,627 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:53,627 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 90 transitions, 693 flow [2021-03-26 10:02:53,627 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 90 transitions, 693 flow [2021-03-26 10:02:53,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 90 transitions, 693 flow [2021-03-26 10:02:53,778 INFO L129 PetriNetUnfolder]: 409/902 cut-off events. [2021-03-26 10:02:53,778 INFO L130 PetriNetUnfolder]: For 2304/2486 co-relation queries the response was YES. [2021-03-26 10:02:53,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 902 events. 409/902 cut-off events. For 2304/2486 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5970 event pairs, 20 based on Foata normal form. 14/872 useless extension candidates. Maximal degree in co-relation 3596. Up to 323 conditions per place. [2021-03-26 10:02:53,793 INFO L142 LiptonReduction]: Number of co-enabled transitions 1392 [2021-03-26 10:02:54,128 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:02:54,257 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:02:54,943 WARN L205 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-26 10:02:55,178 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 10:02:56,620 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 350 DAG size of output: 272 [2021-03-26 10:02:57,173 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:02:57,223 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-26 10:02:57,224 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:02:57,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3597 [2021-03-26 10:02:57,224 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 677 flow [2021-03-26 10:02:57,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:57,225 INFO L263 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, 1, 1] [2021-03-26 10:02:57,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:02:57,225 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 276303959, now seen corresponding path program 1 times [2021-03-26 10:02:57,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:57,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315328620] [2021-03-26 10:02:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:57,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:57,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:57,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:57,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315328620] [2021-03-26 10:02:57,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:57,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:57,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004989565] [2021-03-26 10:02:57,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:57,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:57,299 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 205 [2021-03-26 10:02:57,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 677 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:57,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 205 [2021-03-26 10:02:57,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:57,477 INFO L129 PetriNetUnfolder]: 625/1373 cut-off events. [2021-03-26 10:02:57,478 INFO L130 PetriNetUnfolder]: For 4702/5036 co-relation queries the response was YES. [2021-03-26 10:02:57,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 1373 events. 625/1373 cut-off events. For 4702/5036 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9870 event pairs, 51 based on Foata normal form. 61/1353 useless extension candidates. Maximal degree in co-relation 5402. Up to 472 conditions per place. [2021-03-26 10:02:57,494 INFO L132 encePairwiseOnDemand]: 202/205 looper letters, 3 selfloop transitions, 2 changer transitions 4/88 dead transitions. [2021-03-26 10:02:57,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 88 transitions, 689 flow [2021-03-26 10:02:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:02:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:02:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 702 transitions. [2021-03-26 10:02:57,497 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8560975609756097 [2021-03-26 10:02:57,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 702 transitions. [2021-03-26 10:02:57,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 702 transitions. [2021-03-26 10:02:57,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:57,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 702 transitions. [2021-03-26 10:02:57,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,500 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,500 INFO L185 Difference]: Start difference. First operand has 80 places, 87 transitions, 677 flow. Second operand 4 states and 702 transitions. [2021-03-26 10:02:57,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 88 transitions, 689 flow [2021-03-26 10:02:57,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 628 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 10:02:57,529 INFO L241 Difference]: Finished difference. Result has 77 places, 84 transitions, 593 flow [2021-03-26 10:02:57,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=593, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2021-03-26 10:02:57,529 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2021-03-26 10:02:57,529 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:57,529 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 84 transitions, 593 flow [2021-03-26 10:02:57,530 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 84 transitions, 593 flow [2021-03-26 10:02:57,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 84 transitions, 593 flow [2021-03-26 10:02:57,671 INFO L129 PetriNetUnfolder]: 643/1365 cut-off events. [2021-03-26 10:02:57,671 INFO L130 PetriNetUnfolder]: For 2609/2850 co-relation queries the response was YES. [2021-03-26 10:02:57,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4808 conditions, 1365 events. 643/1365 cut-off events. For 2609/2850 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9876 event pairs, 39 based on Foata normal form. 17/1287 useless extension candidates. Maximal degree in co-relation 4779. Up to 491 conditions per place. [2021-03-26 10:02:57,699 INFO L142 LiptonReduction]: Number of co-enabled transitions 1374 [2021-03-26 10:02:57,713 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-26 10:02:57,714 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:57,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-03-26 10:02:57,714 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 593 flow [2021-03-26 10:02:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:57,715 INFO L263 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] [2021-03-26 10:02:57,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:02:57,715 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 900357456, now seen corresponding path program 1 times [2021-03-26 10:02:57,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:57,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287997122] [2021-03-26 10:02:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:57,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:57,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:57,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:57,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:57,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287997122] [2021-03-26 10:02:57,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:57,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:02:57,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433781453] [2021-03-26 10:02:57,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:02:57,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:02:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:02:57,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 205 [2021-03-26 10:02:57,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:57,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:57,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 205 [2021-03-26 10:02:57,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:58,041 INFO L129 PetriNetUnfolder]: 788/1709 cut-off events. [2021-03-26 10:02:58,041 INFO L130 PetriNetUnfolder]: For 3753/4094 co-relation queries the response was YES. [2021-03-26 10:02:58,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 1709 events. 788/1709 cut-off events. For 3753/4094 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 12932 event pairs, 51 based on Foata normal form. 59/1648 useless extension candidates. Maximal degree in co-relation 5952. Up to 593 conditions per place. [2021-03-26 10:02:58,057 INFO L132 encePairwiseOnDemand]: 202/205 looper letters, 3 selfloop transitions, 2 changer transitions 21/85 dead transitions. [2021-03-26 10:02:58,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 615 flow [2021-03-26 10:02:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:02:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:02:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 722 transitions. [2021-03-26 10:02:58,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8804878048780488 [2021-03-26 10:02:58,060 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 722 transitions. [2021-03-26 10:02:58,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 722 transitions. [2021-03-26 10:02:58,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:58,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 722 transitions. [2021-03-26 10:02:58,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,063 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,063 INFO L185 Difference]: Start difference. First operand has 77 places, 84 transitions, 593 flow. Second operand 4 states and 722 transitions. [2021-03-26 10:02:58,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 615 flow [2021-03-26 10:02:58,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:02:58,100 INFO L241 Difference]: Finished difference. Result has 81 places, 64 transitions, 415 flow [2021-03-26 10:02:58,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2021-03-26 10:02:58,100 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2021-03-26 10:02:58,100 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:58,100 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 64 transitions, 415 flow [2021-03-26 10:02:58,100 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 64 transitions, 415 flow [2021-03-26 10:02:58,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 64 transitions, 415 flow [2021-03-26 10:02:58,173 INFO L129 PetriNetUnfolder]: 312/739 cut-off events. [2021-03-26 10:02:58,173 INFO L130 PetriNetUnfolder]: For 1315/1425 co-relation queries the response was YES. [2021-03-26 10:02:58,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 739 events. 312/739 cut-off events. For 1315/1425 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4780 event pairs, 17 based on Foata normal form. 9/706 useless extension candidates. Maximal degree in co-relation 2516. Up to 244 conditions per place. [2021-03-26 10:02:58,186 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 10:02:58,192 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-26 10:02:58,192 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:58,193 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-03-26 10:02:58,193 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 415 flow [2021-03-26 10:02:58,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:58,206 INFO L263 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] [2021-03-26 10:02:58,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:02:58,206 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash -9380024, now seen corresponding path program 2 times [2021-03-26 10:02:58,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:58,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627382156] [2021-03-26 10:02:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:02:58,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:58,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:02:58,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:02:58,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:02:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:02:58,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627382156] [2021-03-26 10:02:58,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:02:58,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:02:58,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129425038] [2021-03-26 10:02:58,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:02:58,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:02:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:02:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:02:58,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 205 [2021-03-26 10:02:58,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:02:58,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 205 [2021-03-26 10:02:58,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:02:58,403 INFO L129 PetriNetUnfolder]: 556/1252 cut-off events. [2021-03-26 10:02:58,404 INFO L130 PetriNetUnfolder]: For 3886/4207 co-relation queries the response was YES. [2021-03-26 10:02:58,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 1252 events. 556/1252 cut-off events. For 3886/4207 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8986 event pairs, 43 based on Foata normal form. 51/1217 useless extension candidates. Maximal degree in co-relation 4346. Up to 428 conditions per place. [2021-03-26 10:02:58,415 INFO L132 encePairwiseOnDemand]: 202/205 looper letters, 3 selfloop transitions, 2 changer transitions 18/65 dead transitions. [2021-03-26 10:02:58,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 65 transitions, 433 flow [2021-03-26 10:02:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:02:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:02:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2021-03-26 10:02:58,418 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9008130081300812 [2021-03-26 10:02:58,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2021-03-26 10:02:58,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2021-03-26 10:02:58,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:02:58,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2021-03-26 10:02:58,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,421 INFO L185 Difference]: Start difference. First operand has 75 places, 64 transitions, 415 flow. Second operand 3 states and 554 transitions. [2021-03-26 10:02:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 65 transitions, 433 flow [2021-03-26 10:02:58,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 402 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-26 10:02:58,446 INFO L241 Difference]: Finished difference. Result has 71 places, 47 transitions, 266 flow [2021-03-26 10:02:58,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2021-03-26 10:02:58,446 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-26 10:02:58,446 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:58,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 47 transitions, 266 flow [2021-03-26 10:02:58,446 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 47 transitions, 266 flow [2021-03-26 10:02:58,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 47 transitions, 266 flow [2021-03-26 10:02:58,475 INFO L129 PetriNetUnfolder]: 120/292 cut-off events. [2021-03-26 10:02:58,475 INFO L130 PetriNetUnfolder]: For 408/437 co-relation queries the response was YES. [2021-03-26 10:02:58,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 292 events. 120/292 cut-off events. For 408/437 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1437 event pairs, 4 based on Foata normal form. 3/283 useless extension candidates. Maximal degree in co-relation 920. Up to 99 conditions per place. [2021-03-26 10:02:58,479 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-26 10:02:58,619 INFO L154 LiptonReduction]: Checked pairs total: 109 [2021-03-26 10:02:58,619 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:02:58,619 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 173 [2021-03-26 10:02:58,619 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 262 flow [2021-03-26 10:02:58,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:58,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:58,620 INFO L263 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] [2021-03-26 10:02:58,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:02:58,620 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829124, now seen corresponding path program 3 times [2021-03-26 10:02:58,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:58,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078773557] [2021-03-26 10:02:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:58,658 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:58,702 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:58,746 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:02:58,747 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:02:58,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:02:58,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:02:58 BasicIcfg [2021-03-26 10:02:58,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:02:58,871 INFO L168 Benchmark]: Toolchain (without parser) took 27044.02 ms. Allocated memory was 255.9 MB in the beginning and 872.4 MB in the end (delta: 616.6 MB). Free memory was 234.3 MB in the beginning and 543.8 MB in the end (delta: -309.5 MB). Peak memory consumption was 306.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,871 INFO L168 Benchmark]: CDTParser took 2.14 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:02:58,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.78 ms. Allocated memory was 255.9 MB in the beginning and 381.7 MB in the end (delta: 125.8 MB). Free memory was 234.3 MB in the beginning and 343.0 MB in the end (delta: -108.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.32 ms. Allocated memory is still 381.7 MB. Free memory was 343.0 MB in the beginning and 339.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,872 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 381.7 MB. Free memory was 339.5 MB in the beginning and 337.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,875 INFO L168 Benchmark]: RCFGBuilder took 2004.06 ms. Allocated memory is still 381.7 MB. Free memory was 337.4 MB in the beginning and 287.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,878 INFO L168 Benchmark]: TraceAbstraction took 24379.07 ms. Allocated memory was 381.7 MB in the beginning and 872.4 MB in the end (delta: 490.7 MB). Free memory was 287.7 MB in the beginning and 543.8 MB in the end (delta: -256.1 MB). Peak memory consumption was 234.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:58,879 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.14 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 536.78 ms. Allocated memory was 255.9 MB in the beginning and 381.7 MB in the end (delta: 125.8 MB). Free memory was 234.3 MB in the beginning and 343.0 MB in the end (delta: -108.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.32 ms. Allocated memory is still 381.7 MB. Free memory was 343.0 MB in the beginning and 339.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 381.7 MB. Free memory was 339.5 MB in the beginning and 337.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2004.06 ms. Allocated memory is still 381.7 MB. Free memory was 337.4 MB in the beginning and 287.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24379.07 ms. Allocated memory was 381.7 MB in the beginning and 872.4 MB in the end (delta: 490.7 MB). Free memory was 287.7 MB in the beginning and 543.8 MB in the end (delta: -256.1 MB). Peak memory consumption was 234.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9203.6ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2766 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5586 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2606, positive: 2475, positive conditional: 2475, positive unconditional: 0, negative: 131, negative conditional: 131, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2606, positive: 2475, positive conditional: 0, positive unconditional: 2475, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2606, positive: 2475, positive conditional: 0, positive unconditional: 2475, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1831, positive: 1786, positive conditional: 0, positive unconditional: 1786, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1831, positive: 1771, positive conditional: 0, positive unconditional: 1771, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 826, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 742, negative conditional: 0, negative unconditional: 742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2606, positive: 689, positive conditional: 0, positive unconditional: 689, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 1831, unknown conditional: 0, unknown unconditional: 1831] , Statistics on independence cache: Total cache size (in pairs): 1831, Positive cache size: 1786, Positive conditional cache size: 0, Positive unconditional cache size: 1786, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3243.0ms, 53 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 31 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 1748 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 496, positive: 407, positive conditional: 407, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 496, positive: 407, positive conditional: 28, positive unconditional: 379, negative: 89, negative conditional: 3, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 496, positive: 407, positive conditional: 28, positive unconditional: 379, negative: 89, negative conditional: 3, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 61, positive conditional: 7, positive unconditional: 54, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 215, negative conditional: 16, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 496, positive: 346, positive conditional: 21, positive unconditional: 325, negative: 75, negative conditional: 2, negative unconditional: 73, unknown: 75, unknown conditional: 8, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1847, Positive conditional cache size: 7, Positive unconditional cache size: 1840, Negative cache size: 59, Negative conditional cache size: 1, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1164.1ms, 43 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1590 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 398, positive conditional: 398, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 476, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, positive: 386, positive conditional: 0, positive unconditional: 386, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1919, Positive cache size: 1859, Positive conditional cache size: 7, Positive unconditional cache size: 1852, Negative cache size: 60, Negative conditional cache size: 1, Negative unconditional cache size: 59, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 185.5ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 512 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1930, Positive cache size: 1864, Positive conditional cache size: 7, Positive unconditional cache size: 1857, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 210.8ms, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 437 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, positive: 113, positive conditional: 113, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, positive: 113, positive conditional: 15, positive unconditional: 98, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 113, positive conditional: 15, positive unconditional: 98, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, positive: 99, positive conditional: 9, positive unconditional: 90, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1878, Positive conditional cache size: 13, Positive unconditional cache size: 1865, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.5ms, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, positive: 141, positive conditional: 141, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, positive: 141, positive conditional: 27, positive unconditional: 114, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, positive: 141, positive conditional: 27, positive unconditional: 114, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, positive: 140, positive conditional: 26, positive unconditional: 114, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1945, Positive cache size: 1879, Positive conditional cache size: 14, Positive unconditional cache size: 1865, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 135.7ms, 58 PlacesBefore, 58 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 916 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 739 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, positive: 164, positive conditional: 33, positive unconditional: 131, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, positive: 164, positive conditional: 33, positive unconditional: 131, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, positive: 153, positive conditional: 27, positive unconditional: 126, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1890, Positive conditional cache size: 20, Positive unconditional cache size: 1870, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 318.0ms, 60 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 1234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, positive: 191, positive conditional: 191, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, positive: 191, positive conditional: 101, positive unconditional: 90, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, positive: 191, positive conditional: 101, positive unconditional: 90, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 217, positive: 180, positive conditional: 90, positive unconditional: 90, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1967, Positive cache size: 1901, Positive conditional cache size: 31, Positive unconditional cache size: 1870, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 169.1ms, 64 PlacesBefore, 64 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 1304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1092 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, positive: 198, positive conditional: 198, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, positive: 198, positive conditional: 92, positive unconditional: 106, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, positive: 198, positive conditional: 92, positive unconditional: 106, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 12, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, positive: 184, positive conditional: 80, positive unconditional: 104, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1981, Positive cache size: 1915, Positive conditional cache size: 43, Positive unconditional cache size: 1872, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.5ms, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1173 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, positive: 217, positive conditional: 217, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 245, positive: 217, positive conditional: 120, positive unconditional: 97, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 245, positive: 217, positive conditional: 120, positive unconditional: 97, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 245, positive: 211, positive conditional: 114, positive unconditional: 97, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1921, Positive conditional cache size: 49, Positive unconditional cache size: 1872, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 209.7ms, 77 PlacesBefore, 77 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 608 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, positive: 180, positive conditional: 180, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, positive: 180, positive conditional: 90, positive unconditional: 90, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, positive: 180, positive conditional: 90, positive unconditional: 90, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, positive: 174, positive conditional: 85, positive unconditional: 89, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1993, Positive cache size: 1927, Positive conditional cache size: 54, Positive unconditional cache size: 1873, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3596.2ms, 84 PlacesBefore, 80 PlacesAfterwards, 90 TransitionsBefore, 87 TransitionsAfterwards, 1392 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 830, positive: 800, positive conditional: 800, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 830, positive: 800, positive conditional: 441, positive unconditional: 359, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 830, positive: 800, positive conditional: 441, positive unconditional: 359, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 830, positive: 792, positive conditional: 433, positive unconditional: 359, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2001, Positive cache size: 1935, Positive conditional cache size: 62, Positive unconditional cache size: 1873, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 97 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.1ms, 77 PlacesBefore, 77 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 30, positive conditional: 18, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 18, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 30, positive conditional: 18, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2001, Positive cache size: 1935, Positive conditional cache size: 62, Positive unconditional cache size: 1873, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.0ms, 81 PlacesBefore, 75 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 24, positive conditional: 14, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2001, Positive cache size: 1935, Positive conditional cache size: 62, Positive unconditional cache size: 1873, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.3ms, 71 PlacesBefore, 62 PlacesAfterwards, 47 TransitionsBefore, 43 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 109 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, positive: 109, positive conditional: 44, positive unconditional: 65, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 109, positive conditional: 44, positive unconditional: 65, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 8, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 80, positive conditional: 36, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 29, unknown conditional: 8, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1964, Positive conditional cache size: 70, Positive unconditional cache size: 1894, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Eliminated conditions: 37 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t741; [L852] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t742; [L854] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t743; [L856] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 pthread_t t744; [L858] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24121.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3078.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9292.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 60 SDtfs, 52 SDslu, 33 SDs, 0 SdLazy, 438 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 517.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 378.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.3ms SsaConstructionTime, 528.0ms SatisfiabilityAnalysisTime, 972.5ms InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 1238 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! Received shutdown request...