/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:49:32,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:49:32,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:49:32,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:49:32,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:49:32,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:49:32,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:49:32,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:49:32,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:49:32,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:49:32,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:49:32,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:49:32,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:49:32,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:49:32,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:49:32,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:49:32,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:49:32,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:49:32,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:49:32,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:49:32,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:49:32,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:49:32,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:49:32,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:49:32,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:49:32,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:49:32,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:49:32,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:49:32,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:49:32,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:49:32,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:49:32,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:49:32,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:49:32,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:49:32,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:49:32,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:49:32,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:49:32,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:49:32,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:49:32,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:49:32,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:49:32,609 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:49:32,643 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:49:32,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:49:32,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:49:32,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:49:32,647 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:49:32,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:49:32,648 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:49:32,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:49:32,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:49:32,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:49:32,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:49:32,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:49:32,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:49:32,649 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:49:32,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:49:32,650 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:49:32,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:49:32,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:49:32,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:49:32,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:49:32,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:49:32,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:49:32,651 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:49:32,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:49:32,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:49:32,652 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 00:49:32,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:49:33,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:49:33,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:49:33,014 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:49:33,016 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:49:33,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-03-26 00:49:33,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9020765/9b60e7f58be5452185eeccd2357d03de/FLAGc815e78f7 [2021-03-26 00:49:33,670 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:49:33,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-03-26 00:49:33,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9020765/9b60e7f58be5452185eeccd2357d03de/FLAGc815e78f7 [2021-03-26 00:49:34,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9020765/9b60e7f58be5452185eeccd2357d03de [2021-03-26 00:49:34,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:49:34,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:49:34,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:34,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:49:34,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:49:34,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34, skipping insertion in model container [2021-03-26 00:49:34,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:49:34,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:49:34,292 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/safe032_rmo.opt.i[992,1005] [2021-03-26 00:49:34,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:34,545 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:49:34,554 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/safe032_rmo.opt.i[992,1005] [2021-03-26 00:49:34,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:34,649 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:49:34,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34 WrapperNode [2021-03-26 00:49:34,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:34,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:34,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:49:34,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:49:34,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:34,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:49:34,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:49:34,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:49:34,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (1/1) ... [2021-03-26 00:49:34,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:49:34,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:49:34,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:49:34,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:49:34,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (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 00:49:34,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:49:34,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:49:34,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:49:34,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:49:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:49:34,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:49:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:49:34,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:49:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:49:34,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:49:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:49:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:49:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:49:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:49:34,808 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 00:49:37,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:49:37,584 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:49:37,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:37 BoogieIcfgContainer [2021-03-26 00:49:37,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:49:37,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:49:37,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:49:37,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:49:37,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:49:34" (1/3) ... [2021-03-26 00:49:37,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3b56aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:37, skipping insertion in model container [2021-03-26 00:49:37,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:34" (2/3) ... [2021-03-26 00:49:37,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3b56aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:37, skipping insertion in model container [2021-03-26 00:49:37,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:37" (3/3) ... [2021-03-26 00:49:37,593 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2021-03-26 00:49:37,598 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:49:37,602 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:49:37,603 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:37,717 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:49:37,733 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:49:37,757 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:49:37,757 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:49:37,758 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:49:37,758 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:49:37,758 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:49:37,758 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:49:37,758 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:49:37,758 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:49:37,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:49:37,810 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:49:37,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:37,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:49:37,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:49:37,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:37,819 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:37,828 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:37,830 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:37,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:37,863 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:49:37,865 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:37,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:49:37,870 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 00:49:38,902 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:49:39,305 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:49:39,424 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:49:41,138 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:49:41,439 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:49:42,736 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:49:43,323 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:49:44,134 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-26 00:49:44,135 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-26 00:49:44,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6320 [2021-03-26 00:49:44,150 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:49:44,150 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:44,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:44,151 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 00:49:44,151 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-26 00:49:44,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:44,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58833835] [2021-03-26 00:49:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:44,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:44,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:44,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:44,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:44,408 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 00:49:44,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58833835] [2021-03-26 00:49:44,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:44,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:44,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046129218] [2021-03-26 00:49:44,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:44,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:44,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 00:49:44,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 00:49:44,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:44,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 00:49:44,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:44,578 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-26 00:49:44,578 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:44,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-26 00:49:44,583 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 00:49:44,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-26 00:49:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-26 00:49:44,600 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-26 00:49:44,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-26 00:49:44,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-26 00:49:44,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:44,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-26 00:49:44,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 00:49:44,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 00:49:44,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 00:49:44,628 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-26 00:49:44,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-26 00:49:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:49:44,632 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:44,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 00:49:44,634 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:49:44,634 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:44,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:44,635 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:44,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:44,648 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:49:44,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:44,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:49:44,649 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 00:49:45,119 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:49:45,462 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:49:46,649 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-26 00:49:47,248 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:49:47,880 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:49:48,001 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:49:48,823 WARN L205 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 202 [2021-03-26 00:49:49,224 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 00:49:49,884 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 00:49:50,536 WARN L205 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 00:49:50,897 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 00:49:50,898 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:49:50,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6264 [2021-03-26 00:49:50,899 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:49:50,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 00:49:50,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:50,900 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] [2021-03-26 00:49:50,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:49:50,900 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-26 00:49:50,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:50,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362891205] [2021-03-26 00:49:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:50,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:50,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:50,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:50,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:51,004 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:49:51,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:49:51,009 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 00:49:51,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362891205] [2021-03-26 00:49:51,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:51,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:51,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434404785] [2021-03-26 00:49:51,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:51,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:51,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:51,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:51,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2021-03-26 00:49:51,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 00:49:51,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:51,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2021-03-26 00:49:51,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:51,049 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-26 00:49:51,049 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:49:51,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 95 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-03-26 00:49:51,049 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-26 00:49:51,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-03-26 00:49:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-26 00:49:51,052 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2021-03-26 00:49:51,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-26 00:49:51,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-26 00:49:51,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:51,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-26 00:49:51,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:51,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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 00:49:51,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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 00:49:51,056 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 743 transitions. [2021-03-26 00:49:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-03-26 00:49:51,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:51,058 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:51,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 00:49:51,058 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 00:49:51,058 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:51,058 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:51,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:51,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-26 00:49:51,063 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:51,064 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:49:51,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 00:49:51,064 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 00:49:51,668 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:51,802 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:52,106 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:52,235 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:52,238 INFO L154 LiptonReduction]: Checked pairs total: 762 [2021-03-26 00:49:52,238 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:49:52,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1180 [2021-03-26 00:49:52,239 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 00:49:52,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 00:49:52,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:52,240 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:52,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:49:52,240 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash -93592942, now seen corresponding path program 1 times [2021-03-26 00:49:52,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:52,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424486462] [2021-03-26 00:49:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:52,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:52,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:52,307 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 00:49:52,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424486462] [2021-03-26 00:49:52,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:52,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:52,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543649946] [2021-03-26 00:49:52,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:52,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:52,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 176 [2021-03-26 00:49:52,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 00:49:52,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:52,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 176 [2021-03-26 00:49:52,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:52,331 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:52,331 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:49:52,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 3/31 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:49:52,331 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 00:49:52,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 77 flow [2021-03-26 00:49:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 00:49:52,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882575757575758 [2021-03-26 00:49:52,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 00:49:52,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 00:49:52,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:52,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 00:49:52,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 00:49:52,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 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 00:49:52,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 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 00:49:52,337 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 3 states and 469 transitions. [2021-03-26 00:49:52,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 77 flow [2021-03-26 00:49:52,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:52,339 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:52,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 00:49:52,339 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-26 00:49:52,339 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:52,339 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:52,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:52,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:52,345 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:52,345 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:49:52,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 00:49:52,346 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 00:49:52,407 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 00:49:52,407 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:52,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 00:49:52,408 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:52,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 00:49:52,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:52,409 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:52,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:49:52,409 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1371931757, now seen corresponding path program 1 times [2021-03-26 00:49:52,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:52,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072479831] [2021-03-26 00:49:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:52,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:52,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:52,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:49:52,599 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 00:49:52,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072479831] [2021-03-26 00:49:52,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:52,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:52,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222165593] [2021-03-26 00:49:52,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:52,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:52,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 176 [2021-03-26 00:49:52,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 00:49:52,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:52,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 176 [2021-03-26 00:49:52,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:52,738 INFO L129 PetriNetUnfolder]: 143/282 cut-off events. [2021-03-26 00:49:52,739 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-03-26 00:49:52,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 282 events. 143/282 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1246 event pairs, 41 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 601. Up to 175 conditions per place. [2021-03-26 00:49:52,742 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 14 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-26 00:49:52,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 147 flow [2021-03-26 00:49:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2021-03-26 00:49:52,745 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7542613636363636 [2021-03-26 00:49:52,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2021-03-26 00:49:52,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2021-03-26 00:49:52,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:52,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2021-03-26 00:49:52,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 00:49:52,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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 00:49:52,749 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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 00:49:52,749 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 4 states and 531 transitions. [2021-03-26 00:49:52,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 147 flow [2021-03-26 00:49:52,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:52,751 INFO L241 Difference]: Finished difference. Result has 36 places, 29 transitions, 122 flow [2021-03-26 00:49:52,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2021-03-26 00:49:52,752 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-26 00:49:52,752 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:52,752 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 122 flow [2021-03-26 00:49:52,752 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 122 flow [2021-03-26 00:49:52,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 122 flow [2021-03-26 00:49:52,774 INFO L129 PetriNetUnfolder]: 51/164 cut-off events. [2021-03-26 00:49:52,774 INFO L130 PetriNetUnfolder]: For 47/51 co-relation queries the response was YES. [2021-03-26 00:49:52,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 164 events. 51/164 cut-off events. For 47/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 793 event pairs, 8 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 342. Up to 66 conditions per place. [2021-03-26 00:49:52,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 00:49:52,858 INFO L154 LiptonReduction]: Checked pairs total: 74 [2021-03-26 00:49:52,858 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:52,859 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:49:52,860 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 122 flow [2021-03-26 00:49:52,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 00:49:52,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:52,861 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:52,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:49:52,861 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -139097833, now seen corresponding path program 2 times [2021-03-26 00:49:52,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:52,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21865151] [2021-03-26 00:49:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:52,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:49:52,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:52,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:49:52,988 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-26 00:49:52,994 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-26 00:49:53,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:53,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:53,038 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 00:49:53,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21865151] [2021-03-26 00:49:53,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:53,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:53,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872596120] [2021-03-26 00:49:53,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:53,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:53,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 176 [2021-03-26 00:49:53,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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 00:49:53,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:53,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 176 [2021-03-26 00:49:53,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:53,284 INFO L129 PetriNetUnfolder]: 177/355 cut-off events. [2021-03-26 00:49:53,284 INFO L130 PetriNetUnfolder]: For 225/258 co-relation queries the response was YES. [2021-03-26 00:49:53,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 355 events. 177/355 cut-off events. For 225/258 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1752 event pairs, 11 based on Foata normal form. 18/361 useless extension candidates. Maximal degree in co-relation 941. Up to 196 conditions per place. [2021-03-26 00:49:53,289 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 21 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2021-03-26 00:49:53,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 257 flow [2021-03-26 00:49:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-26 00:49:53,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7522727272727273 [2021-03-26 00:49:53,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-26 00:49:53,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-26 00:49:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:53,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-26 00:49:53,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 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 00:49:53,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 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 00:49:53,297 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 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 00:49:53,297 INFO L185 Difference]: Start difference. First operand has 36 places, 29 transitions, 122 flow. Second operand 5 states and 662 transitions. [2021-03-26 00:49:53,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 257 flow [2021-03-26 00:49:53,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:53,299 INFO L241 Difference]: Finished difference. Result has 42 places, 37 transitions, 204 flow [2021-03-26 00:49:53,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2021-03-26 00:49:53,300 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-26 00:49:53,300 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:53,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 204 flow [2021-03-26 00:49:53,300 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 204 flow [2021-03-26 00:49:53,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 204 flow [2021-03-26 00:49:53,369 INFO L129 PetriNetUnfolder]: 144/323 cut-off events. [2021-03-26 00:49:53,369 INFO L130 PetriNetUnfolder]: For 220/227 co-relation queries the response was YES. [2021-03-26 00:49:53,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 323 events. 144/323 cut-off events. For 220/227 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1706 event pairs, 34 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 878. Up to 170 conditions per place. [2021-03-26 00:49:53,374 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 00:49:53,394 INFO L154 LiptonReduction]: Checked pairs total: 68 [2021-03-26 00:49:53,394 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:53,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-26 00:49:53,396 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 204 flow [2021-03-26 00:49:53,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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 00:49:53,397 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:53,397 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:53,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:49:53,397 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash 31455503, now seen corresponding path program 1 times [2021-03-26 00:49:53,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:53,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442723306] [2021-03-26 00:49:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:53,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:53,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:53,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:53,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:49:53,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:49:53,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:49:53,608 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 00:49:53,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442723306] [2021-03-26 00:49:53,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:53,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:49:53,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901380352] [2021-03-26 00:49:53,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:49:53,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:49:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:49:53,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 00:49:53,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 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 00:49:53,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:53,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 00:49:53,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:53,823 INFO L129 PetriNetUnfolder]: 195/388 cut-off events. [2021-03-26 00:49:53,823 INFO L130 PetriNetUnfolder]: For 411/475 co-relation queries the response was YES. [2021-03-26 00:49:53,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 388 events. 195/388 cut-off events. For 411/475 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1963 event pairs, 9 based on Foata normal form. 19/390 useless extension candidates. Maximal degree in co-relation 1310. Up to 202 conditions per place. [2021-03-26 00:49:53,828 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 20 selfloop transitions, 21 changer transitions 0/54 dead transitions. [2021-03-26 00:49:53,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 372 flow [2021-03-26 00:49:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:49:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:49:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2021-03-26 00:49:53,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.740530303030303 [2021-03-26 00:49:53,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 782 transitions. [2021-03-26 00:49:53,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 782 transitions. [2021-03-26 00:49:53,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:53,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 782 transitions. [2021-03-26 00:49:53,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 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 00:49:53,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 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 00:49:53,835 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 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 00:49:53,835 INFO L185 Difference]: Start difference. First operand has 42 places, 37 transitions, 204 flow. Second operand 6 states and 782 transitions. [2021-03-26 00:49:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 372 flow [2021-03-26 00:49:53,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:53,841 INFO L241 Difference]: Finished difference. Result has 49 places, 47 transitions, 326 flow [2021-03-26 00:49:53,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2021-03-26 00:49:53,842 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-26 00:49:53,842 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:53,842 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 47 transitions, 326 flow [2021-03-26 00:49:53,842 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 326 flow [2021-03-26 00:49:53,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 326 flow [2021-03-26 00:49:53,888 INFO L129 PetriNetUnfolder]: 144/315 cut-off events. [2021-03-26 00:49:53,888 INFO L130 PetriNetUnfolder]: For 681/745 co-relation queries the response was YES. [2021-03-26 00:49:53,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 315 events. 144/315 cut-off events. For 681/745 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1619 event pairs, 26 based on Foata normal form. 16/309 useless extension candidates. Maximal degree in co-relation 1088. Up to 168 conditions per place. [2021-03-26 00:49:53,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-26 00:49:55,079 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:49:55,548 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 00:49:57,875 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 377 DAG size of output: 319 [2021-03-26 00:49:58,921 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 308 [2021-03-26 00:49:58,948 INFO L154 LiptonReduction]: Checked pairs total: 388 [2021-03-26 00:49:58,948 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:49:58,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5106 [2021-03-26 00:49:58,949 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 329 flow [2021-03-26 00:49:58,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 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 00:49:58,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:58,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:58,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:49:58,950 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -418300867, now seen corresponding path program 2 times [2021-03-26 00:49:58,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:58,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403253275] [2021-03-26 00:49:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:59,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:59,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:59,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:59,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:49:59,065 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 00:49:59,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403253275] [2021-03-26 00:49:59,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:59,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:59,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394996258] [2021-03-26 00:49:59,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:59,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:59,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:59,069 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 177 [2021-03-26 00:49:59,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 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 00:49:59,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:59,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 177 [2021-03-26 00:49:59,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:59,283 INFO L129 PetriNetUnfolder]: 210/428 cut-off events. [2021-03-26 00:49:59,283 INFO L130 PetriNetUnfolder]: For 1003/1113 co-relation queries the response was YES. [2021-03-26 00:49:59,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 428 events. 210/428 cut-off events. For 1003/1113 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2319 event pairs, 10 based on Foata normal form. 40/457 useless extension candidates. Maximal degree in co-relation 1713. Up to 231 conditions per place. [2021-03-26 00:49:59,288 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 27 selfloop transitions, 28 changer transitions 0/68 dead transitions. [2021-03-26 00:49:59,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 592 flow [2021-03-26 00:49:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:49:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:49:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2021-03-26 00:49:59,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7335216572504708 [2021-03-26 00:49:59,291 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2021-03-26 00:49:59,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2021-03-26 00:49:59,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:59,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2021-03-26 00:49:59,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 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 00:49:59,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 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 00:49:59,295 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 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 00:49:59,295 INFO L185 Difference]: Start difference. First operand has 49 places, 47 transitions, 329 flow. Second operand 6 states and 779 transitions. [2021-03-26 00:49:59,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 592 flow [2021-03-26 00:49:59,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 580 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-26 00:49:59,302 INFO L241 Difference]: Finished difference. Result has 57 places, 61 transitions, 554 flow [2021-03-26 00:49:59,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2021-03-26 00:49:59,302 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-26 00:49:59,302 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:59,302 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 554 flow [2021-03-26 00:49:59,302 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 61 transitions, 554 flow [2021-03-26 00:49:59,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 554 flow [2021-03-26 00:49:59,363 INFO L129 PetriNetUnfolder]: 177/392 cut-off events. [2021-03-26 00:49:59,363 INFO L130 PetriNetUnfolder]: For 1268/1396 co-relation queries the response was YES. [2021-03-26 00:49:59,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 392 events. 177/392 cut-off events. For 1268/1396 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2173 event pairs, 10 based on Foata normal form. 44/421 useless extension candidates. Maximal degree in co-relation 1656. Up to 200 conditions per place. [2021-03-26 00:49:59,369 INFO L142 LiptonReduction]: Number of co-enabled transitions 462 [2021-03-26 00:49:59,390 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 00:49:59,390 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:59,390 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-26 00:49:59,393 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 554 flow [2021-03-26 00:49:59,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 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 00:49:59,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:59,394 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:59,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:49:59,394 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 528428453, now seen corresponding path program 1 times [2021-03-26 00:49:59,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:59,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485012255] [2021-03-26 00:49:59,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:59,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:59,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:59,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:59,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:59,527 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 00:49:59,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485012255] [2021-03-26 00:49:59,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:59,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:59,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785951159] [2021-03-26 00:49:59,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:59,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:59,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:59,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 177 [2021-03-26 00:49:59,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 00:49:59,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:59,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 177 [2021-03-26 00:49:59,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:59,710 INFO L129 PetriNetUnfolder]: 230/503 cut-off events. [2021-03-26 00:49:59,710 INFO L130 PetriNetUnfolder]: For 1833/2016 co-relation queries the response was YES. [2021-03-26 00:49:59,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 503 events. 230/503 cut-off events. For 1833/2016 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2966 event pairs, 22 based on Foata normal form. 40/533 useless extension candidates. Maximal degree in co-relation 2353. Up to 291 conditions per place. [2021-03-26 00:49:59,716 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 38 selfloop transitions, 26 changer transitions 0/77 dead transitions. [2021-03-26 00:49:59,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 840 flow [2021-03-26 00:49:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2021-03-26 00:49:59,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7641242937853108 [2021-03-26 00:49:59,719 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2021-03-26 00:49:59,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2021-03-26 00:49:59,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:59,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2021-03-26 00:49:59,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 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 00:49:59,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 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 00:49:59,722 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 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 00:49:59,722 INFO L185 Difference]: Start difference. First operand has 57 places, 61 transitions, 554 flow. Second operand 4 states and 541 transitions. [2021-03-26 00:49:59,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 840 flow [2021-03-26 00:49:59,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 807 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:59,730 INFO L241 Difference]: Finished difference. Result has 60 places, 74 transitions, 788 flow [2021-03-26 00:49:59,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=788, PETRI_PLACES=60, PETRI_TRANSITIONS=74} [2021-03-26 00:49:59,731 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2021-03-26 00:49:59,731 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:59,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 74 transitions, 788 flow [2021-03-26 00:49:59,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 74 transitions, 788 flow [2021-03-26 00:49:59,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 74 transitions, 788 flow [2021-03-26 00:49:59,803 INFO L129 PetriNetUnfolder]: 190/444 cut-off events. [2021-03-26 00:49:59,804 INFO L130 PetriNetUnfolder]: For 1982/2160 co-relation queries the response was YES. [2021-03-26 00:49:59,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 444 events. 190/444 cut-off events. For 1982/2160 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2692 event pairs, 24 based on Foata normal form. 43/463 useless extension candidates. Maximal degree in co-relation 2080. Up to 226 conditions per place. [2021-03-26 00:49:59,810 INFO L142 LiptonReduction]: Number of co-enabled transitions 554 [2021-03-26 00:49:59,837 INFO L154 LiptonReduction]: Checked pairs total: 458 [2021-03-26 00:49:59,837 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:59,837 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 00:49:59,838 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 74 transitions, 788 flow [2021-03-26 00:49:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 00:49:59,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:59,839 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:59,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:49:59,839 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 931307361, now seen corresponding path program 1 times [2021-03-26 00:49:59,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:59,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304177740] [2021-03-26 00:49:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:59,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:59,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:59,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:59,972 INFO L142 QuantifierPusher]: treesize reduction 41, result has 52.9 percent of original size [2021-03-26 00:49:59,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:49:59,980 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:49:59,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:50:00,003 INFO L142 QuantifierPusher]: treesize reduction 14, result has 78.1 percent of original size [2021-03-26 00:50:00,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:50:00,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:00,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:00,043 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 00:50:00,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304177740] [2021-03-26 00:50:00,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:00,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:00,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074262783] [2021-03-26 00:50:00,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:00,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:00,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:00,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 177 [2021-03-26 00:50:00,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 74 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 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 00:50:00,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:00,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 177 [2021-03-26 00:50:00,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:00,283 INFO L129 PetriNetUnfolder]: 266/593 cut-off events. [2021-03-26 00:50:00,283 INFO L130 PetriNetUnfolder]: For 2877/3071 co-relation queries the response was YES. [2021-03-26 00:50:00,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 593 events. 266/593 cut-off events. For 2877/3071 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3706 event pairs, 43 based on Foata normal form. 45/620 useless extension candidates. Maximal degree in co-relation 3046. Up to 371 conditions per place. [2021-03-26 00:50:00,290 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 47 selfloop transitions, 33 changer transitions 0/93 dead transitions. [2021-03-26 00:50:00,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 1166 flow [2021-03-26 00:50:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:50:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:50:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2021-03-26 00:50:00,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7559322033898305 [2021-03-26 00:50:00,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2021-03-26 00:50:00,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2021-03-26 00:50:00,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:00,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2021-03-26 00:50:00,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 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 00:50:00,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:00,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:00,296 INFO L185 Difference]: Start difference. First operand has 60 places, 74 transitions, 788 flow. Second operand 5 states and 669 transitions. [2021-03-26 00:50:00,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 1166 flow [2021-03-26 00:50:00,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 1163 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:50:00,306 INFO L241 Difference]: Finished difference. Result has 65 places, 90 transitions, 1107 flow [2021-03-26 00:50:00,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=65, PETRI_TRANSITIONS=90} [2021-03-26 00:50:00,306 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2021-03-26 00:50:00,306 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:00,306 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 90 transitions, 1107 flow [2021-03-26 00:50:00,307 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 90 transitions, 1107 flow [2021-03-26 00:50:00,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 90 transitions, 1107 flow [2021-03-26 00:50:00,395 INFO L129 PetriNetUnfolder]: 249/565 cut-off events. [2021-03-26 00:50:00,395 INFO L130 PetriNetUnfolder]: For 3312/3558 co-relation queries the response was YES. [2021-03-26 00:50:00,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 565 events. 249/565 cut-off events. For 3312/3558 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3517 event pairs, 45 based on Foata normal form. 53/592 useless extension candidates. Maximal degree in co-relation 2937. Up to 274 conditions per place. [2021-03-26 00:50:00,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 648 [2021-03-26 00:50:00,467 INFO L154 LiptonReduction]: Checked pairs total: 942 [2021-03-26 00:50:00,467 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:00,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 161 [2021-03-26 00:50:00,469 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 90 transitions, 1107 flow [2021-03-26 00:50:00,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 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 00:50:00,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:00,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:00,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:50:00,470 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 783228623, now seen corresponding path program 1 times [2021-03-26 00:50:00,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:00,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246650549] [2021-03-26 00:50:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:00,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:00,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:50:00,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:00,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:00,514 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 00:50:00,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246650549] [2021-03-26 00:50:00,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:00,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:50:00,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921100672] [2021-03-26 00:50:00,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:50:00,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:50:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:50:00,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 177 [2021-03-26 00:50:00,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 90 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 00:50:00,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:00,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 177 [2021-03-26 00:50:00,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:00,654 INFO L129 PetriNetUnfolder]: 286/689 cut-off events. [2021-03-26 00:50:00,655 INFO L130 PetriNetUnfolder]: For 4559/4844 co-relation queries the response was YES. [2021-03-26 00:50:00,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 689 events. 286/689 cut-off events. For 4559/4844 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4663 event pairs, 42 based on Foata normal form. 59/718 useless extension candidates. Maximal degree in co-relation 3697. Up to 348 conditions per place. [2021-03-26 00:50:00,661 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 4 selfloop transitions, 3 changer transitions 4/90 dead transitions. [2021-03-26 00:50:00,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 1121 flow [2021-03-26 00:50:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:50:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:50:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-26 00:50:00,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8700564971751412 [2021-03-26 00:50:00,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-26 00:50:00,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-26 00:50:00,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:00,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-26 00:50:00,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 00:50:00,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 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 00:50:00,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 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 00:50:00,666 INFO L185 Difference]: Start difference. First operand has 65 places, 90 transitions, 1107 flow. Second operand 3 states and 462 transitions. [2021-03-26 00:50:00,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 1121 flow [2021-03-26 00:50:00,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 1110 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 00:50:00,681 INFO L241 Difference]: Finished difference. Result has 67 places, 86 transitions, 1040 flow [2021-03-26 00:50:00,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=67, PETRI_TRANSITIONS=86} [2021-03-26 00:50:00,682 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2021-03-26 00:50:00,682 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:00,682 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 86 transitions, 1040 flow [2021-03-26 00:50:00,682 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 86 transitions, 1040 flow [2021-03-26 00:50:00,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 86 transitions, 1040 flow [2021-03-26 00:50:00,800 INFO L129 PetriNetUnfolder]: 295/700 cut-off events. [2021-03-26 00:50:00,800 INFO L130 PetriNetUnfolder]: For 4152/4443 co-relation queries the response was YES. [2021-03-26 00:50:00,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 700 events. 295/700 cut-off events. For 4152/4443 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4756 event pairs, 55 based on Foata normal form. 44/706 useless extension candidates. Maximal degree in co-relation 3728. Up to 357 conditions per place. [2021-03-26 00:50:00,811 INFO L142 LiptonReduction]: Number of co-enabled transitions 622 [2021-03-26 00:50:00,917 INFO L154 LiptonReduction]: Checked pairs total: 848 [2021-03-26 00:50:00,917 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:00,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 235 [2021-03-26 00:50:00,919 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 86 transitions, 1040 flow [2021-03-26 00:50:00,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 00:50:00,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:00,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:00,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:50:00,919 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:00,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1196266397, now seen corresponding path program 2 times [2021-03-26 00:50:00,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:00,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80543640] [2021-03-26 00:50:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:01,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:01,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:01,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:01,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:01,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:01,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:01,048 INFO L142 QuantifierPusher]: treesize reduction 17, result has 48.5 percent of original size [2021-03-26 00:50:01,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:01,052 INFO L142 QuantifierPusher]: treesize reduction 26, result has 64.9 percent of original size [2021-03-26 00:50:01,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:50:01,101 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-03-26 00:50:01,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:50:01,121 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 00:50:01,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80543640] [2021-03-26 00:50:01,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:01,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:01,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503578799] [2021-03-26 00:50:01,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:01,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:01,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 177 [2021-03-26 00:50:01,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 86 transitions, 1040 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 00:50:01,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:01,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 177 [2021-03-26 00:50:01,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:01,523 INFO L129 PetriNetUnfolder]: 320/761 cut-off events. [2021-03-26 00:50:01,523 INFO L130 PetriNetUnfolder]: For 5146/5562 co-relation queries the response was YES. [2021-03-26 00:50:01,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 761 events. 320/761 cut-off events. For 5146/5562 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5308 event pairs, 23 based on Foata normal form. 54/793 useless extension candidates. Maximal degree in co-relation 4482. Up to 371 conditions per place. [2021-03-26 00:50:01,530 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 30 selfloop transitions, 35 changer transitions 17/95 dead transitions. [2021-03-26 00:50:01,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 1294 flow [2021-03-26 00:50:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:50:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:50:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2021-03-26 00:50:01,534 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7288135593220338 [2021-03-26 00:50:01,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2021-03-26 00:50:01,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2021-03-26 00:50:01,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:01,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2021-03-26 00:50:01,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 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 00:50:01,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:01,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:01,538 INFO L185 Difference]: Start difference. First operand has 67 places, 86 transitions, 1040 flow. Second operand 5 states and 645 transitions. [2021-03-26 00:50:01,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 1294 flow [2021-03-26 00:50:01,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 1289 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:50:01,551 INFO L241 Difference]: Finished difference. Result has 72 places, 74 transitions, 1023 flow [2021-03-26 00:50:01,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2021-03-26 00:50:01,551 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2021-03-26 00:50:01,551 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:01,551 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 74 transitions, 1023 flow [2021-03-26 00:50:01,552 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 74 transitions, 1023 flow [2021-03-26 00:50:01,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 74 transitions, 1023 flow [2021-03-26 00:50:01,668 INFO L129 PetriNetUnfolder]: 230/559 cut-off events. [2021-03-26 00:50:01,668 INFO L130 PetriNetUnfolder]: For 5143/5414 co-relation queries the response was YES. [2021-03-26 00:50:01,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 559 events. 230/559 cut-off events. For 5143/5414 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3617 event pairs, 45 based on Foata normal form. 45/576 useless extension candidates. Maximal degree in co-relation 3431. Up to 313 conditions per place. [2021-03-26 00:50:01,676 INFO L142 LiptonReduction]: Number of co-enabled transitions 494 [2021-03-26 00:50:01,744 INFO L154 LiptonReduction]: Checked pairs total: 657 [2021-03-26 00:50:01,744 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:01,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 194 [2021-03-26 00:50:01,745 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 1023 flow [2021-03-26 00:50:01,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 00:50:01,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:01,746 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:01,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:50:01,746 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1866153971, now seen corresponding path program 1 times [2021-03-26 00:50:01,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:01,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089317418] [2021-03-26 00:50:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:01,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:01,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:01,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:01,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:01,881 INFO L142 QuantifierPusher]: treesize reduction 36, result has 68.1 percent of original size [2021-03-26 00:50:01,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 00:50:01,929 INFO L142 QuantifierPusher]: treesize reduction 36, result has 68.1 percent of original size [2021-03-26 00:50:01,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 00:50:01,937 INFO L142 QuantifierPusher]: treesize reduction 36, result has 69.7 percent of original size [2021-03-26 00:50:01,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-03-26 00:50:01,991 INFO L142 QuantifierPusher]: treesize reduction 36, result has 69.0 percent of original size [2021-03-26 00:50:01,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-26 00:50:02,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:02,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:50:02,055 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 00:50:02,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089317418] [2021-03-26 00:50:02,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:02,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:02,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177391660] [2021-03-26 00:50:02,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:02,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:02,057 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-26 00:50:02,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 1023 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 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 00:50:02,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:02,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-26 00:50:02,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:02,447 INFO L129 PetriNetUnfolder]: 263/646 cut-off events. [2021-03-26 00:50:02,447 INFO L130 PetriNetUnfolder]: For 6338/6667 co-relation queries the response was YES. [2021-03-26 00:50:02,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 646 events. 263/646 cut-off events. For 6338/6667 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4410 event pairs, 15 based on Foata normal form. 52/679 useless extension candidates. Maximal degree in co-relation 4296. Up to 345 conditions per place. [2021-03-26 00:50:02,452 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 35 selfloop transitions, 32 changer transitions 6/86 dead transitions. [2021-03-26 00:50:02,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 1305 flow [2021-03-26 00:50:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2021-03-26 00:50:02,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7078288942695722 [2021-03-26 00:50:02,456 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2021-03-26 00:50:02,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2021-03-26 00:50:02,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:02,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2021-03-26 00:50:02,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 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 00:50:02,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 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 00:50:02,460 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 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 00:50:02,460 INFO L185 Difference]: Start difference. First operand has 72 places, 74 transitions, 1023 flow. Second operand 7 states and 877 transitions. [2021-03-26 00:50:02,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 1305 flow [2021-03-26 00:50:02,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 1250 flow, removed 11 selfloop flow, removed 6 redundant places. [2021-03-26 00:50:02,473 INFO L241 Difference]: Finished difference. Result has 73 places, 73 transitions, 1036 flow [2021-03-26 00:50:02,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1036, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2021-03-26 00:50:02,474 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2021-03-26 00:50:02,474 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:02,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 73 transitions, 1036 flow [2021-03-26 00:50:02,474 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 73 transitions, 1036 flow [2021-03-26 00:50:02,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 1036 flow [2021-03-26 00:50:02,552 INFO L129 PetriNetUnfolder]: 191/531 cut-off events. [2021-03-26 00:50:02,553 INFO L130 PetriNetUnfolder]: For 4731/4814 co-relation queries the response was YES. [2021-03-26 00:50:02,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 531 events. 191/531 cut-off events. For 4731/4814 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3655 event pairs, 44 based on Foata normal form. 23/530 useless extension candidates. Maximal degree in co-relation 3247. Up to 262 conditions per place. [2021-03-26 00:50:02,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 462 [2021-03-26 00:50:02,608 INFO L154 LiptonReduction]: Checked pairs total: 623 [2021-03-26 00:50:02,608 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:02,608 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-26 00:50:02,611 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 1036 flow [2021-03-26 00:50:02,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 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 00:50:02,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:02,611 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:02,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:50:02,612 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash -590856384, now seen corresponding path program 1 times [2021-03-26 00:50:02,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:02,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718700080] [2021-03-26 00:50:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:02,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:02,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:02,685 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:50:02,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:02,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:02,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:50:02,695 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 00:50:02,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718700080] [2021-03-26 00:50:02,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:02,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:50:02,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808184020] [2021-03-26 00:50:02,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:50:02,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:50:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:50:02,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 177 [2021-03-26 00:50:02,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 1036 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 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 00:50:02,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:02,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 177 [2021-03-26 00:50:02,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:02,920 INFO L129 PetriNetUnfolder]: 557/1229 cut-off events. [2021-03-26 00:50:02,921 INFO L130 PetriNetUnfolder]: For 6377/6734 co-relation queries the response was YES. [2021-03-26 00:50:02,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1229 events. 557/1229 cut-off events. For 6377/6734 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 9338 event pairs, 188 based on Foata normal form. 288/1437 useless extension candidates. Maximal degree in co-relation 4898. Up to 735 conditions per place. [2021-03-26 00:50:02,928 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 9 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2021-03-26 00:50:02,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 1006 flow [2021-03-26 00:50:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:50:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:50:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 00:50:02,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564971751412429 [2021-03-26 00:50:02,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 00:50:02,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 00:50:02,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:02,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 00:50:02,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 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 00:50:02,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:02,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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 00:50:02,935 INFO L185 Difference]: Start difference. First operand has 73 places, 73 transitions, 1036 flow. Second operand 5 states and 758 transitions. [2021-03-26 00:50:02,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 1006 flow [2021-03-26 00:50:02,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 938 flow, removed 8 selfloop flow, removed 7 redundant places. [2021-03-26 00:50:02,949 INFO L241 Difference]: Finished difference. Result has 73 places, 74 transitions, 948 flow [2021-03-26 00:50:02,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2021-03-26 00:50:02,950 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2021-03-26 00:50:02,950 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:02,950 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 74 transitions, 948 flow [2021-03-26 00:50:02,950 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 948 flow [2021-03-26 00:50:02,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 948 flow [2021-03-26 00:50:03,089 INFO L129 PetriNetUnfolder]: 552/1222 cut-off events. [2021-03-26 00:50:03,089 INFO L130 PetriNetUnfolder]: For 6076/6490 co-relation queries the response was YES. [2021-03-26 00:50:03,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 1222 events. 552/1222 cut-off events. For 6076/6490 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 9489 event pairs, 180 based on Foata normal form. 70/1173 useless extension candidates. Maximal degree in co-relation 5541. Up to 743 conditions per place. [2021-03-26 00:50:03,101 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-26 00:50:03,308 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 00:50:03,747 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-26 00:50:03,911 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 00:50:03,943 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-26 00:50:03,943 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:50:03,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 994 [2021-03-26 00:50:03,944 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 957 flow [2021-03-26 00:50:03,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 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 00:50:03,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:03,946 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 00:50:03,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:50:03,946 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:03,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1940808342, now seen corresponding path program 1 times [2021-03-26 00:50:03,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:03,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358542681] [2021-03-26 00:50:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:04,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:04,032 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:50:04,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:50:04,036 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:50:04,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:04,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:50:04,049 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 00:50:04,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358542681] [2021-03-26 00:50:04,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:04,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:04,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191955791] [2021-03-26 00:50:04,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:50:04,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:50:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:50:04,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2021-03-26 00:50:04,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 957 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 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 00:50:04,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:04,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2021-03-26 00:50:04,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:04,226 INFO L129 PetriNetUnfolder]: 323/878 cut-off events. [2021-03-26 00:50:04,226 INFO L130 PetriNetUnfolder]: For 5048/6596 co-relation queries the response was YES. [2021-03-26 00:50:04,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 878 events. 323/878 cut-off events. For 5048/6596 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 7157 event pairs, 28 based on Foata normal form. 635/1462 useless extension candidates. Maximal degree in co-relation 4241. Up to 577 conditions per place. [2021-03-26 00:50:04,233 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 6 selfloop transitions, 15 changer transitions 4/82 dead transitions. [2021-03-26 00:50:04,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 1024 flow [2021-03-26 00:50:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1068 transitions. [2021-03-26 00:50:04,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-26 00:50:04,237 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1068 transitions. [2021-03-26 00:50:04,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1068 transitions. [2021-03-26 00:50:04,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:04,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1068 transitions. [2021-03-26 00:50:04,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.57142857142858) internal successors, (1068), 7 states have internal predecessors, (1068), 0 states have call successors, (0), 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 00:50:04,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 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 00:50:04,241 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 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 00:50:04,241 INFO L185 Difference]: Start difference. First operand has 73 places, 74 transitions, 957 flow. Second operand 7 states and 1068 transitions. [2021-03-26 00:50:04,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 1024 flow [2021-03-26 00:50:04,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 1000 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-26 00:50:04,252 INFO L241 Difference]: Finished difference. Result has 80 places, 78 transitions, 979 flow [2021-03-26 00:50:04,253 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=979, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2021-03-26 00:50:04,253 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2021-03-26 00:50:04,253 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:04,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 78 transitions, 979 flow [2021-03-26 00:50:04,253 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 78 transitions, 979 flow [2021-03-26 00:50:04,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 979 flow [2021-03-26 00:50:04,343 INFO L129 PetriNetUnfolder]: 281/816 cut-off events. [2021-03-26 00:50:04,344 INFO L130 PetriNetUnfolder]: For 5333/5769 co-relation queries the response was YES. [2021-03-26 00:50:04,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4320 conditions, 816 events. 281/816 cut-off events. For 5333/5769 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 6796 event pairs, 28 based on Foata normal form. 62/838 useless extension candidates. Maximal degree in co-relation 4285. Up to 517 conditions per place. [2021-03-26 00:50:04,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 636 [2021-03-26 00:50:04,359 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:04,359 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:04,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:50:04,361 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 979 flow [2021-03-26 00:50:04,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 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 00:50:04,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:04,361 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 00:50:04,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:50:04,361 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1285877364, now seen corresponding path program 1 times [2021-03-26 00:50:04,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:04,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130887394] [2021-03-26 00:50:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:04,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:04,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:04,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:04,463 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:50:04,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:04,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:04,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:50:04,475 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 00:50:04,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130887394] [2021-03-26 00:50:04,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:04,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:04,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332175950] [2021-03-26 00:50:04,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:04,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:04,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2021-03-26 00:50:04,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 979 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 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 00:50:04,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:04,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2021-03-26 00:50:04,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:04,692 INFO L129 PetriNetUnfolder]: 223/691 cut-off events. [2021-03-26 00:50:04,692 INFO L130 PetriNetUnfolder]: For 6152/8232 co-relation queries the response was YES. [2021-03-26 00:50:04,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 691 events. 223/691 cut-off events. For 6152/8232 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 5820 event pairs, 0 based on Foata normal form. 656/1304 useless extension candidates. Maximal degree in co-relation 4004. Up to 480 conditions per place. [2021-03-26 00:50:04,697 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 19 changer transitions 10/81 dead transitions. [2021-03-26 00:50:04,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 81 transitions, 1042 flow [2021-03-26 00:50:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:50:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:50:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1367 transitions. [2021-03-26 00:50:04,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8533083645443196 [2021-03-26 00:50:04,700 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1367 transitions. [2021-03-26 00:50:04,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1367 transitions. [2021-03-26 00:50:04,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:04,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1367 transitions. [2021-03-26 00:50:04,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.88888888888889) internal successors, (1367), 9 states have internal predecessors, (1367), 0 states have call successors, (0), 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 00:50:04,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 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 00:50:04,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 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 00:50:04,708 INFO L185 Difference]: Start difference. First operand has 80 places, 78 transitions, 979 flow. Second operand 9 states and 1367 transitions. [2021-03-26 00:50:04,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 81 transitions, 1042 flow [2021-03-26 00:50:04,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 988 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-03-26 00:50:04,726 INFO L241 Difference]: Finished difference. Result has 88 places, 71 transitions, 854 flow [2021-03-26 00:50:04,726 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=854, PETRI_PLACES=88, PETRI_TRANSITIONS=71} [2021-03-26 00:50:04,726 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2021-03-26 00:50:04,726 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:04,726 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 71 transitions, 854 flow [2021-03-26 00:50:04,726 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 71 transitions, 854 flow [2021-03-26 00:50:04,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 71 transitions, 854 flow [2021-03-26 00:50:04,770 INFO L129 PetriNetUnfolder]: 121/427 cut-off events. [2021-03-26 00:50:04,771 INFO L130 PetriNetUnfolder]: For 2475/2585 co-relation queries the response was YES. [2021-03-26 00:50:04,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 427 events. 121/427 cut-off events. For 2475/2585 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 3338 event pairs, 0 based on Foata normal form. 27/433 useless extension candidates. Maximal degree in co-relation 2135. Up to 130 conditions per place. [2021-03-26 00:50:04,776 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:50:05,526 WARN L205 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 00:50:05,792 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:50:07,259 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 338 DAG size of output: 262 [2021-03-26 00:50:07,864 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 00:50:08,153 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:50:08,426 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:50:09,077 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:50:09,717 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:50:09,722 INFO L154 LiptonReduction]: Checked pairs total: 77 [2021-03-26 00:50:09,723 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:50:09,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4997 [2021-03-26 00:50:09,723 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 824 flow [2021-03-26 00:50:09,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 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 00:50:09,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:09,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:09,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:50:09,724 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 73742967, now seen corresponding path program 1 times [2021-03-26 00:50:09,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:09,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763081042] [2021-03-26 00:50:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:09,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:09,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:09,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:09,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:09,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:09,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:09,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:09,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:50:09,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:09,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:09,840 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 00:50:09,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763081042] [2021-03-26 00:50:09,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:09,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:09,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801291007] [2021-03-26 00:50:09,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:09,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:09,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2021-03-26 00:50:09,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 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 00:50:09,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:09,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2021-03-26 00:50:09,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:10,139 INFO L129 PetriNetUnfolder]: 83/264 cut-off events. [2021-03-26 00:50:10,140 INFO L130 PetriNetUnfolder]: For 1996/2084 co-relation queries the response was YES. [2021-03-26 00:50:10,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 264 events. 83/264 cut-off events. For 1996/2084 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1620 event pairs, 0 based on Foata normal form. 21/275 useless extension candidates. Maximal degree in co-relation 1556. Up to 91 conditions per place. [2021-03-26 00:50:10,142 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 17 selfloop transitions, 20 changer transitions 10/65 dead transitions. [2021-03-26 00:50:10,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 65 transitions, 922 flow [2021-03-26 00:50:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:50:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:50:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1010 transitions. [2021-03-26 00:50:10,145 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2021-03-26 00:50:10,146 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1010 transitions. [2021-03-26 00:50:10,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1010 transitions. [2021-03-26 00:50:10,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:10,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1010 transitions. [2021-03-26 00:50:10,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 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 00:50:10,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 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 00:50:10,164 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 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 00:50:10,164 INFO L185 Difference]: Start difference. First operand has 85 places, 66 transitions, 824 flow. Second operand 8 states and 1010 transitions. [2021-03-26 00:50:10,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 65 transitions, 922 flow [2021-03-26 00:50:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 874 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-26 00:50:10,174 INFO L241 Difference]: Finished difference. Result has 76 places, 55 transitions, 670 flow [2021-03-26 00:50:10,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2021-03-26 00:50:10,175 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2021-03-26 00:50:10,175 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:10,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 55 transitions, 670 flow [2021-03-26 00:50:10,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 55 transitions, 670 flow [2021-03-26 00:50:10,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 55 transitions, 670 flow [2021-03-26 00:50:10,201 INFO L129 PetriNetUnfolder]: 55/188 cut-off events. [2021-03-26 00:50:10,201 INFO L130 PetriNetUnfolder]: For 1036/1046 co-relation queries the response was YES. [2021-03-26 00:50:10,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 188 events. 55/188 cut-off events. For 1036/1046 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1043 event pairs, 0 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 926. Up to 55 conditions per place. [2021-03-26 00:50:10,203 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-26 00:50:10,205 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:10,205 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:10,205 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 00:50:10,206 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 670 flow [2021-03-26 00:50:10,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 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 00:50:10,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:10,206 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:10,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:50:10,207 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1243182951, now seen corresponding path program 1 times [2021-03-26 00:50:10,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:10,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306189345] [2021-03-26 00:50:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:10,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:10,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:10,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:50:10,341 INFO L142 QuantifierPusher]: treesize reduction 17, result has 75.0 percent of original size [2021-03-26 00:50:10,343 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.4 percent of original size 42 [2021-03-26 00:50:10,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:50:10,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:50:10,428 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 00:50:10,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306189345] [2021-03-26 00:50:10,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:10,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:50:10,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35186707] [2021-03-26 00:50:10,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:50:10,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:50:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:50:10,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 180 [2021-03-26 00:50:10,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 670 flow. Second operand has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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 00:50:10,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:10,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 180 [2021-03-26 00:50:10,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:10,765 INFO L129 PetriNetUnfolder]: 63/212 cut-off events. [2021-03-26 00:50:10,765 INFO L130 PetriNetUnfolder]: For 1500/1540 co-relation queries the response was YES. [2021-03-26 00:50:10,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 212 events. 63/212 cut-off events. For 1500/1540 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1206 event pairs, 0 based on Foata normal form. 20/225 useless extension candidates. Maximal degree in co-relation 1074. Up to 62 conditions per place. [2021-03-26 00:50:10,767 INFO L132 encePairwiseOnDemand]: 170/180 looper letters, 10 selfloop transitions, 17 changer transitions 11/56 dead transitions. [2021-03-26 00:50:10,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 56 transitions, 756 flow [2021-03-26 00:50:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 00:50:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 00:50:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1187 transitions. [2021-03-26 00:50:10,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6594444444444445 [2021-03-26 00:50:10,772 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1187 transitions. [2021-03-26 00:50:10,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1187 transitions. [2021-03-26 00:50:10,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:10,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1187 transitions. [2021-03-26 00:50:10,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.7) internal successors, (1187), 10 states have internal predecessors, (1187), 0 states have call successors, (0), 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 00:50:10,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 180.0) internal successors, (1980), 11 states have internal predecessors, (1980), 0 states have call successors, (0), 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 00:50:10,778 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 180.0) internal successors, (1980), 11 states have internal predecessors, (1980), 0 states have call successors, (0), 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 00:50:10,778 INFO L185 Difference]: Start difference. First operand has 74 places, 55 transitions, 670 flow. Second operand 10 states and 1187 transitions. [2021-03-26 00:50:10,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 56 transitions, 756 flow [2021-03-26 00:50:10,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 56 transitions, 729 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-26 00:50:10,784 INFO L241 Difference]: Finished difference. Result has 79 places, 45 transitions, 548 flow [2021-03-26 00:50:10,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=548, PETRI_PLACES=79, PETRI_TRANSITIONS=45} [2021-03-26 00:50:10,785 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-26 00:50:10,785 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:10,785 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 45 transitions, 548 flow [2021-03-26 00:50:10,785 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 45 transitions, 548 flow [2021-03-26 00:50:10,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 45 transitions, 548 flow [2021-03-26 00:50:10,815 INFO L129 PetriNetUnfolder]: 27/101 cut-off events. [2021-03-26 00:50:10,815 INFO L130 PetriNetUnfolder]: For 766/779 co-relation queries the response was YES. [2021-03-26 00:50:10,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 101 events. 27/101 cut-off events. For 766/779 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 404 event pairs, 0 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 545. Up to 31 conditions per place. [2021-03-26 00:50:10,816 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 00:50:10,818 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:10,818 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:10,818 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 00:50:10,819 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 45 transitions, 548 flow [2021-03-26 00:50:10,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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 00:50:10,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:10,819 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:10,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:50:10,820 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1394370435, now seen corresponding path program 2 times [2021-03-26 00:50:10,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:10,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496659767] [2021-03-26 00:50:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:10,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:10,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:10,918 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-26 00:50:10,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 00:50:10,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:10,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:50:10,989 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 00:50:10,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496659767] [2021-03-26 00:50:10,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:10,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:10,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811048557] [2021-03-26 00:50:10,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:10,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:10,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 180 [2021-03-26 00:50:10,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 45 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 00:50:10,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:10,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 180 [2021-03-26 00:50:10,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:11,201 INFO L129 PetriNetUnfolder]: 39/137 cut-off events. [2021-03-26 00:50:11,201 INFO L130 PetriNetUnfolder]: For 1031/1063 co-relation queries the response was YES. [2021-03-26 00:50:11,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 137 events. 39/137 cut-off events. For 1031/1063 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 592 event pairs, 0 based on Foata normal form. 7/139 useless extension candidates. Maximal degree in co-relation 734. Up to 39 conditions per place. [2021-03-26 00:50:11,202 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 12 selfloop transitions, 8 changer transitions 13/49 dead transitions. [2021-03-26 00:50:11,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 49 transitions, 666 flow [2021-03-26 00:50:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:50:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:50:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2021-03-26 00:50:11,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2021-03-26 00:50:11,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2021-03-26 00:50:11,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2021-03-26 00:50:11,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:11,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2021-03-26 00:50:11,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 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 00:50:11,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 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 00:50:11,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 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 00:50:11,209 INFO L185 Difference]: Start difference. First operand has 75 places, 45 transitions, 548 flow. Second operand 6 states and 762 transitions. [2021-03-26 00:50:11,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 49 transitions, 666 flow [2021-03-26 00:50:11,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 49 transitions, 546 flow, removed 15 selfloop flow, removed 12 redundant places. [2021-03-26 00:50:11,214 INFO L241 Difference]: Finished difference. Result has 69 places, 36 transitions, 358 flow [2021-03-26 00:50:11,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=69, PETRI_TRANSITIONS=36} [2021-03-26 00:50:11,214 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2021-03-26 00:50:11,214 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:11,214 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 36 transitions, 358 flow [2021-03-26 00:50:11,214 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 36 transitions, 358 flow [2021-03-26 00:50:11,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 36 transitions, 358 flow [2021-03-26 00:50:11,221 INFO L129 PetriNetUnfolder]: 11/49 cut-off events. [2021-03-26 00:50:11,222 INFO L130 PetriNetUnfolder]: For 262/265 co-relation queries the response was YES. [2021-03-26 00:50:11,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 49 events. 11/49 cut-off events. For 262/265 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 99 event pairs, 0 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 215. Up to 13 conditions per place. [2021-03-26 00:50:11,222 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-26 00:50:12,116 WARN L205 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-26 00:50:12,466 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 00:50:14,263 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:15,064 WARN L205 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:16,005 WARN L205 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:50:16,408 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:50:18,353 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:19,216 WARN L205 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:19,503 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-26 00:50:19,504 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:50:19,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8290 [2021-03-26 00:50:19,504 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 35 transitions, 364 flow [2021-03-26 00:50:19,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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 00:50:19,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:19,505 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:19,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:50:19,505 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash -416899955, now seen corresponding path program 1 times [2021-03-26 00:50:19,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:19,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319607474] [2021-03-26 00:50:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:19,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:19,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:19,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:19,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:19,575 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:50:19,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:50:19,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:19,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:19,616 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 00:50:19,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319607474] [2021-03-26 00:50:19,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:19,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:19,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592323783] [2021-03-26 00:50:19,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:19,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:19,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:19,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:19,619 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 184 [2021-03-26 00:50:19,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 35 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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 00:50:19,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:19,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 184 [2021-03-26 00:50:19,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:19,714 INFO L129 PetriNetUnfolder]: 17/68 cut-off events. [2021-03-26 00:50:19,714 INFO L130 PetriNetUnfolder]: For 416/425 co-relation queries the response was YES. [2021-03-26 00:50:19,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 68 events. 17/68 cut-off events. For 416/425 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 199 event pairs, 0 based on Foata normal form. 7/74 useless extension candidates. Maximal degree in co-relation 319. Up to 20 conditions per place. [2021-03-26 00:50:19,714 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 15 selfloop transitions, 2 changer transitions 9/41 dead transitions. [2021-03-26 00:50:19,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 41 transitions, 487 flow [2021-03-26 00:50:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:50:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:50:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2021-03-26 00:50:19,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7010869565217391 [2021-03-26 00:50:19,717 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2021-03-26 00:50:19,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2021-03-26 00:50:19,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:19,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2021-03-26 00:50:19,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 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 00:50:19,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 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 00:50:19,720 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 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 00:50:19,720 INFO L185 Difference]: Start difference. First operand has 67 places, 35 transitions, 364 flow. Second operand 6 states and 774 transitions. [2021-03-26 00:50:19,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 41 transitions, 487 flow [2021-03-26 00:50:19,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 372 flow, removed 13 selfloop flow, removed 16 redundant places. [2021-03-26 00:50:19,723 INFO L241 Difference]: Finished difference. Result has 57 places, 32 transitions, 241 flow [2021-03-26 00:50:19,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2021-03-26 00:50:19,723 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-26 00:50:19,723 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:19,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 32 transitions, 241 flow [2021-03-26 00:50:19,723 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 32 transitions, 241 flow [2021-03-26 00:50:19,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 32 transitions, 241 flow [2021-03-26 00:50:19,730 INFO L129 PetriNetUnfolder]: 10/43 cut-off events. [2021-03-26 00:50:19,731 INFO L130 PetriNetUnfolder]: For 90/91 co-relation queries the response was YES. [2021-03-26 00:50:19,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 43 events. 10/43 cut-off events. For 90/91 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2021-03-26 00:50:19,731 INFO L142 LiptonReduction]: Number of co-enabled transitions 42 [2021-03-26 00:50:20,798 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:50:21,224 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:50:23,050 WARN L205 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:23,957 WARN L205 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:23,960 INFO L154 LiptonReduction]: Checked pairs total: 1 [2021-03-26 00:50:23,960 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:50:23,961 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4238 [2021-03-26 00:50:23,961 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 239 flow [2021-03-26 00:50:23,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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 00:50:23,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:23,962 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 00:50:23,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 00:50:23,962 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2050137458, now seen corresponding path program 1 times [2021-03-26 00:50:23,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:23,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577141141] [2021-03-26 00:50:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:50:24,028 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:50:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:50:24,083 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:50:24,145 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:50:24,145 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:50:24,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 00:50:24,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:50:24 BasicIcfg [2021-03-26 00:50:24,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:50:24,253 INFO L168 Benchmark]: Toolchain (without parser) took 50186.94 ms. Allocated memory was 255.9 MB in the beginning and 880.8 MB in the end (delta: 625.0 MB). Free memory was 234.8 MB in the beginning and 692.4 MB in the end (delta: -457.6 MB). Peak memory consumption was 167.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,254 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:50:24,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.80 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.4 MB in the beginning and 319.3 MB in the end (delta: -84.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 362.8 MB. Free memory was 319.3 MB in the beginning and 316.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,254 INFO L168 Benchmark]: Boogie Preprocessor took 32.16 ms. Allocated memory is still 362.8 MB. Free memory was 316.6 MB in the beginning and 313.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,254 INFO L168 Benchmark]: RCFGBuilder took 2857.65 ms. Allocated memory is still 362.8 MB. Free memory was 313.4 MB in the beginning and 319.6 MB in the end (delta: -6.2 MB). Peak memory consumption was 186.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,258 INFO L168 Benchmark]: TraceAbstraction took 46664.15 ms. Allocated memory was 362.8 MB in the beginning and 880.8 MB in the end (delta: 518.0 MB). Free memory was 318.6 MB in the beginning and 692.4 MB in the end (delta: -373.8 MB). Peak memory consumption was 145.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:50:24,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 582.80 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.4 MB in the beginning and 319.3 MB in the end (delta: -84.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 362.8 MB. Free memory was 319.3 MB in the beginning and 316.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.16 ms. Allocated memory is still 362.8 MB. Free memory was 316.6 MB in the beginning and 313.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2857.65 ms. Allocated memory is still 362.8 MB. Free memory was 313.4 MB in the beginning and 319.6 MB in the end (delta: -6.2 MB). Peak memory consumption was 186.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 46664.15 ms. Allocated memory was 362.8 MB in the beginning and 880.8 MB in the end (delta: 518.0 MB). Free memory was 318.6 MB in the beginning and 692.4 MB in the end (delta: -373.8 MB). Peak memory consumption was 145.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6304.3ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 895, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 882, negative conditional: 0, negative unconditional: 882, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 314, positive conditional: 314, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 1076, unknown conditional: 1076, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 60, Positive conditional cache size: 60, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6262.1ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 361, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, positive: 94, positive conditional: 7, positive unconditional: 87, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, positive: 94, positive conditional: 7, positive unconditional: 87, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 102, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 113, negative conditional: 17, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 267, positive conditional: 267, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 102, unknown conditional: 102, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1179.3ms, 37 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 762 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 242, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 9, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 9, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 242, positive: 168, positive conditional: 168, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.5ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 108, Positive conditional cache size: 108, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.3ms, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 4, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 4, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 68 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 12, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 12, positive unconditional: 10, 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: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 67, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 145, Positive conditional cache size: 145, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5105.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 388 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 307, positive: 293, positive conditional: 293, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 29, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 29, positive unconditional: 14, 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: 43, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, positive: 250, positive conditional: 250, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 87.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 224, positive: 215, positive conditional: 215, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 26, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 26, 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: 34, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 181, positive conditional: 181, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 199, Positive conditional cache size: 199, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.4ms, 60 PlacesBefore, 60 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 369, positive: 352, positive conditional: 352, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 38, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 38, positive unconditional: 9, 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: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 369, positive: 305, positive conditional: 305, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 160.8ms, 65 PlacesBefore, 65 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 700, positive: 678, positive conditional: 678, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 53, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 53, positive unconditional: 7, 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: 60, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 700, positive: 618, positive conditional: 618, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 234.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 623, positive: 603, positive conditional: 603, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 623, positive: 590, positive conditional: 590, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 319, Positive conditional cache size: 319, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.8ms, 72 PlacesBefore, 72 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 657 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 475, positive: 452, positive conditional: 452, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 46, positive conditional: 41, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, positive: 46, positive conditional: 41, 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: 46, positive: 46, positive conditional: 0, positive unconditional: 46, 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: 475, positive: 406, positive conditional: 406, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 365, Positive conditional cache size: 365, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.9ms, 73 PlacesBefore, 73 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 433, positive: 409, positive conditional: 409, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 38, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 38, positive unconditional: 3, 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: 41, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 433, positive: 368, positive conditional: 368, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 406, Positive conditional cache size: 406, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 993.5ms, 73 PlacesBefore, 73 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 370, Positive conditional cache size: 370, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.2ms, 80 PlacesBefore, 80 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 370, Positive conditional cache size: 370, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4996.2ms, 88 PlacesBefore, 85 PlacesAfterwards, 71 TransitionsBefore, 66 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, positive: 77, positive conditional: 77, 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: 77, positive: 77, positive conditional: 0, positive unconditional: 77, 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: 77, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 77, unknown conditional: 77, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 313, Positive conditional cache size: 313, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.8ms, 76 PlacesBefore, 74 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 313, Positive conditional cache size: 313, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.3ms, 79 PlacesBefore, 75 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 313, Positive conditional cache size: 313, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8289.3ms, 69 PlacesBefore, 67 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 201, Positive conditional cache size: 201, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4237.0ms, 57 PlacesBefore, 51 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 174, Positive conditional cache size: 174, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2552; [L850] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2553; [L852] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2554; [L854] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=60, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L827] 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) [L827] 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) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 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 [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 46392.7ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4361.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6386.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 75 SDslu, 38 SDs, 0 SdLazy, 620 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1193.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1488.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1107occurred in iteration=9, InterpolantAutomatonStates: 107, 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: 78.4ms SsaConstructionTime, 728.9ms SatisfiabilityAnalysisTime, 2031.2ms InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 2396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...