/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:55:07,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:55:07,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:55:07,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:55:07,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:55:07,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:55:07,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:55:07,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:55:07,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:55:07,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:55:07,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:55:07,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:55:07,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:55:07,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:55:07,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:55:07,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:55:07,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:55:07,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:55:07,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:55:07,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:55:07,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:55:07,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:55:07,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:55:07,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:55:07,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:55:07,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:55:07,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:55:07,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:55:07,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:55:07,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:55:07,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:55:07,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:55:07,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:55:07,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:55:07,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:55:07,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:55:07,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:55:07,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:55:07,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:55:07,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:55:07,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:55:07,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:55:07,833 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:55:07,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:55:07,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:55:07,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:55:07,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:55:07,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:55:07,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:55:07,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:55:07,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:55:07,837 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 09:55:08,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:55:08,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:55:08,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:55:08,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:55:08,131 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:55:08,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013_pso.opt.i [2021-03-26 09:55:08,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94399708/4bde10b8f19e4fb6af846571423877f9/FLAGa18a4e49a [2021-03-26 09:55:08,609 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:55:08,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_pso.opt.i [2021-03-26 09:55:08,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94399708/4bde10b8f19e4fb6af846571423877f9/FLAGa18a4e49a [2021-03-26 09:55:08,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94399708/4bde10b8f19e4fb6af846571423877f9 [2021-03-26 09:55:08,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:55:08,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:55:08,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:55:08,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:55:08,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:55:08,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:55:08" (1/1) ... [2021-03-26 09:55:08,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2f8fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:08, skipping insertion in model container [2021-03-26 09:55:08,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:55:08" (1/1) ... [2021-03-26 09:55:08,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:55:09,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:55:09,100 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/mix013_pso.opt.i[948,961] [2021-03-26 09:55:09,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:55:09,289 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:55:09,299 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/mix013_pso.opt.i[948,961] [2021-03-26 09:55:09,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:55:09,380 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:55:09,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09 WrapperNode [2021-03-26 09:55:09,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:55:09,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:55:09,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:55:09,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:55:09,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:55:09,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:55:09,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:55:09,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:55:09,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (1/1) ... [2021-03-26 09:55:09,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:55:09,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:55:09,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:55:09,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:55:09,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (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 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:55:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:55:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:55:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:55:09,547 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 09:55:09,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 09:55:09,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:55:09,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:55:09,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:55:09,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:55:09,548 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 09:55:11,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:55:11,141 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:55:11,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:55:11 BoogieIcfgContainer [2021-03-26 09:55:11,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:55:11,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:55:11,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:55:11,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:55:11,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:55:08" (1/3) ... [2021-03-26 09:55:11,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9dc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:55:11, skipping insertion in model container [2021-03-26 09:55:11,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:09" (2/3) ... [2021-03-26 09:55:11,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9dc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:55:11, skipping insertion in model container [2021-03-26 09:55:11,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:55:11" (3/3) ... [2021-03-26 09:55:11,147 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_pso.opt.i [2021-03-26 09:55:11,151 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:55:11,153 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:55:11,154 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:55:11,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,244 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,244 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,250 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:11,254 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:55:11,266 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 09:55:11,278 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:55:11,278 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:55:11,278 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:55:11,278 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:55:11,278 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:55:11,278 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:55:11,278 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:55:11,278 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:55:11,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 09:55:11,321 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 09:55:11,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:11,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:55:11,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 09:55:11,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-26 09:55:11,329 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:11,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 09:55:11,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 09:55:11,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-26 09:55:11,369 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 09:55:11,369 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:11,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:55:11,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 2510 [2021-03-26 09:55:12,494 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:55:12,869 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 09:55:12,977 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 09:55:13,945 INFO L154 LiptonReduction]: Checked pairs total: 4176 [2021-03-26 09:55:13,946 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 09:55:13,947 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2619 [2021-03-26 09:55:13,955 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 09:55:13,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:13,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:13,956 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:13,956 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash -333288266, now seen corresponding path program 1 times [2021-03-26 09:55:13,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:13,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666351756] [2021-03-26 09:55:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:14,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:14,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:14,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:14,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:14,180 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 09:55:14,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666351756] [2021-03-26 09:55:14,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:14,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:55:14,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18088903] [2021-03-26 09:55:14,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:55:14,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:55:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:55:14,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2021-03-26 09:55:14,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:14,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:14,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2021-03-26 09:55:14,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:14,293 INFO L129 PetriNetUnfolder]: 13/76 cut-off events. [2021-03-26 09:55:14,293 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:14,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 76 events. 13/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 180 event pairs, 1 based on Foata normal form. 7/79 useless extension candidates. Maximal degree in co-relation 95. Up to 25 conditions per place. [2021-03-26 09:55:14,294 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 6 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2021-03-26 09:55:14,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 124 flow [2021-03-26 09:55:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:55:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:55:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2021-03-26 09:55:14,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2021-03-26 09:55:14,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2021-03-26 09:55:14,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2021-03-26 09:55:14,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:14,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2021-03-26 09:55:14,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 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 09:55:14,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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 09:55:14,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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 09:55:14,338 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 530 transitions. [2021-03-26 09:55:14,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 124 flow [2021-03-26 09:55:14,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:14,341 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 09:55:14,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 09:55:14,343 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 09:55:14,344 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:14,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 09:55:14,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 09:55:14,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 09:55:14,349 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 09:55:14,349 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:14,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:55:14,350 INFO L142 LiptonReduction]: Number of co-enabled transitions 546 [2021-03-26 09:55:15,638 INFO L154 LiptonReduction]: Checked pairs total: 2220 [2021-03-26 09:55:15,638 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 09:55:15,638 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1294 [2021-03-26 09:55:15,640 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 09:55:15,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:15,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:15,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:15,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:55:15,641 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash 975759929, now seen corresponding path program 1 times [2021-03-26 09:55:15,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:15,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093355319] [2021-03-26 09:55:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:15,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:15,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:15,776 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:15,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:15,788 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:55:15,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:55:15,793 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 09:55:15,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093355319] [2021-03-26 09:55:15,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:15,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:15,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495063436] [2021-03-26 09:55:15,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:15,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:15,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2021-03-26 09:55:15,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 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 09:55:15,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:15,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2021-03-26 09:55:15,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:15,919 INFO L129 PetriNetUnfolder]: 258/555 cut-off events. [2021-03-26 09:55:15,919 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:15,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 555 events. 258/555 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3267 event pairs, 81 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 957. Up to 200 conditions per place. [2021-03-26 09:55:15,925 INFO L132 encePairwiseOnDemand]: 198/207 looper letters, 7 selfloop transitions, 5 changer transitions 15/48 dead transitions. [2021-03-26 09:55:15,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 160 flow [2021-03-26 09:55:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:55:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:55:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-26 09:55:15,930 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8473429951690822 [2021-03-26 09:55:15,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-26 09:55:15,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-26 09:55:15,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:15,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-26 09:55:15,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 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 09:55:15,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:15,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:15,934 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 877 transitions. [2021-03-26 09:55:15,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 160 flow [2021-03-26 09:55:15,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:15,936 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2021-03-26 09:55:15,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 09:55:15,937 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-26 09:55:15,937 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:15,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 111 flow [2021-03-26 09:55:15,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 111 flow [2021-03-26 09:55:15,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 111 flow [2021-03-26 09:55:15,966 INFO L129 PetriNetUnfolder]: 112/257 cut-off events. [2021-03-26 09:55:15,966 INFO L130 PetriNetUnfolder]: For 82/89 co-relation queries the response was YES. [2021-03-26 09:55:15,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 257 events. 112/257 cut-off events. For 82/89 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1266 event pairs, 82 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 557. Up to 158 conditions per place. [2021-03-26 09:55:15,969 INFO L142 LiptonReduction]: Number of co-enabled transitions 400 [2021-03-26 09:55:16,555 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 09:55:16,726 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 09:55:17,126 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 09:55:17,290 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 09:55:17,303 INFO L154 LiptonReduction]: Checked pairs total: 564 [2021-03-26 09:55:17,303 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:17,304 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1367 [2021-03-26 09:55:17,304 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 107 flow [2021-03-26 09:55:17,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 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 09:55:17,305 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:17,305 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:17,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:55:17,305 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1159795433, now seen corresponding path program 1 times [2021-03-26 09:55:17,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:17,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183447526] [2021-03-26 09:55:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:17,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:17,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:17,357 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:17,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:17,369 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 09:55:17,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183447526] [2021-03-26 09:55:17,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:17,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:55:17,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713883471] [2021-03-26 09:55:17,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:17,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:17,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2021-03-26 09:55:17,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:17,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2021-03-26 09:55:17,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:17,427 INFO L129 PetriNetUnfolder]: 101/231 cut-off events. [2021-03-26 09:55:17,427 INFO L130 PetriNetUnfolder]: For 132/235 co-relation queries the response was YES. [2021-03-26 09:55:17,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 231 events. 101/231 cut-off events. For 132/235 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1003 event pairs, 15 based on Foata normal form. 4/228 useless extension candidates. Maximal degree in co-relation 647. Up to 141 conditions per place. [2021-03-26 09:55:17,429 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 13 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2021-03-26 09:55:17,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 161 flow [2021-03-26 09:55:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:55:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:55:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 09:55:17,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8580542264752791 [2021-03-26 09:55:17,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:17,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:17,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 09:55:17,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 09:55:17,435 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 107 flow. Second operand 3 states and 538 transitions. [2021-03-26 09:55:17,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 161 flow [2021-03-26 09:55:17,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:55:17,437 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 113 flow [2021-03-26 09:55:17,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 09:55:17,437 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -19 predicate places. [2021-03-26 09:55:17,437 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:17,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 113 flow [2021-03-26 09:55:17,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 113 flow [2021-03-26 09:55:17,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 113 flow [2021-03-26 09:55:17,468 INFO L129 PetriNetUnfolder]: 87/204 cut-off events. [2021-03-26 09:55:17,468 INFO L130 PetriNetUnfolder]: For 107/114 co-relation queries the response was YES. [2021-03-26 09:55:17,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 204 events. 87/204 cut-off events. For 107/114 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 941 event pairs, 60 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 487. Up to 129 conditions per place. [2021-03-26 09:55:17,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-26 09:55:17,473 INFO L154 LiptonReduction]: Checked pairs total: 172 [2021-03-26 09:55:17,473 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:17,473 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-26 09:55:17,474 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 113 flow [2021-03-26 09:55:17,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:17,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:17,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:55:17,475 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash 151643619, now seen corresponding path program 1 times [2021-03-26 09:55:17,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:17,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861957767] [2021-03-26 09:55:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:17,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:17,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:17,565 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:17,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:17,575 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 09:55:17,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861957767] [2021-03-26 09:55:17,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:17,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:55:17,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348784917] [2021-03-26 09:55:17,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:17,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:17,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:17,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:17,578 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2021-03-26 09:55:17,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:17,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2021-03-26 09:55:17,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:17,626 INFO L129 PetriNetUnfolder]: 81/203 cut-off events. [2021-03-26 09:55:17,627 INFO L130 PetriNetUnfolder]: For 169/226 co-relation queries the response was YES. [2021-03-26 09:55:17,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 203 events. 81/203 cut-off events. For 169/226 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 900 event pairs, 44 based on Foata normal form. 10/208 useless extension candidates. Maximal degree in co-relation 583. Up to 113 conditions per place. [2021-03-26 09:55:17,628 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 13 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2021-03-26 09:55:17,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 170 flow [2021-03-26 09:55:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:55:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:55:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 09:55:17,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8580542264752791 [2021-03-26 09:55:17,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:17,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 09:55:17,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:17,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 09:55:17,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 09:55:17,632 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 113 flow. Second operand 3 states and 538 transitions. [2021-03-26 09:55:17,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 170 flow [2021-03-26 09:55:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:17,634 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 118 flow [2021-03-26 09:55:17,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 09:55:17,634 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2021-03-26 09:55:17,635 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:17,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 118 flow [2021-03-26 09:55:17,635 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 118 flow [2021-03-26 09:55:17,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 118 flow [2021-03-26 09:55:17,650 INFO L129 PetriNetUnfolder]: 67/173 cut-off events. [2021-03-26 09:55:17,650 INFO L130 PetriNetUnfolder]: For 87/94 co-relation queries the response was YES. [2021-03-26 09:55:17,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 173 events. 67/173 cut-off events. For 87/94 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 796 event pairs, 52 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 417. Up to 106 conditions per place. [2021-03-26 09:55:17,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 396 [2021-03-26 09:55:17,654 INFO L154 LiptonReduction]: Checked pairs total: 185 [2021-03-26 09:55:17,654 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:17,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 09:55:17,657 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 118 flow [2021-03-26 09:55:17,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,658 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:17,658 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:17,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:55:17,658 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 94292516, now seen corresponding path program 1 times [2021-03-26 09:55:17,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:17,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747113407] [2021-03-26 09:55:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:17,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:17,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:17,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:17,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:17,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:17,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:17,752 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 09:55:17,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747113407] [2021-03-26 09:55:17,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:17,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:17,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688765314] [2021-03-26 09:55:17,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:17,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:17,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2021-03-26 09:55:17,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:17,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2021-03-26 09:55:17,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:17,848 INFO L129 PetriNetUnfolder]: 477/908 cut-off events. [2021-03-26 09:55:17,848 INFO L130 PetriNetUnfolder]: For 224/237 co-relation queries the response was YES. [2021-03-26 09:55:17,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 908 events. 477/908 cut-off events. For 224/237 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5833 event pairs, 174 based on Foata normal form. 65/779 useless extension candidates. Maximal degree in co-relation 2014. Up to 599 conditions per place. [2021-03-26 09:55:17,855 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 12 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 09:55:17,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 190 flow [2021-03-26 09:55:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:55:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:55:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-03-26 09:55:17,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8602870813397129 [2021-03-26 09:55:17,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-03-26 09:55:17,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-03-26 09:55:17,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:17,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-03-26 09:55:17,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 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 09:55:17,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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 09:55:17,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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 09:55:17,860 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 118 flow. Second operand 5 states and 899 transitions. [2021-03-26 09:55:17,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 190 flow [2021-03-26 09:55:17,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:17,863 INFO L241 Difference]: Finished difference. Result has 48 places, 40 transitions, 187 flow [2021-03-26 09:55:17,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2021-03-26 09:55:17,864 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2021-03-26 09:55:17,864 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:17,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 187 flow [2021-03-26 09:55:17,864 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 187 flow [2021-03-26 09:55:17,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 187 flow [2021-03-26 09:55:17,911 INFO L129 PetriNetUnfolder]: 372/758 cut-off events. [2021-03-26 09:55:17,911 INFO L130 PetriNetUnfolder]: For 566/645 co-relation queries the response was YES. [2021-03-26 09:55:17,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 758 events. 372/758 cut-off events. For 566/645 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4968 event pairs, 194 based on Foata normal form. 9/708 useless extension candidates. Maximal degree in co-relation 2197. Up to 476 conditions per place. [2021-03-26 09:55:17,918 INFO L142 LiptonReduction]: Number of co-enabled transitions 542 [2021-03-26 09:55:17,937 INFO L154 LiptonReduction]: Checked pairs total: 413 [2021-03-26 09:55:17,937 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:17,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-26 09:55:17,939 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 181 flow [2021-03-26 09:55:17,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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 09:55:17,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:17,940 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 09:55:17,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:55:17,940 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1569105796, now seen corresponding path program 1 times [2021-03-26 09:55:17,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:17,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834631470] [2021-03-26 09:55:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:18,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:18,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:18,045 INFO L142 QuantifierPusher]: treesize reduction 45, result has 6.3 percent of original size [2021-03-26 09:55:18,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:18,057 INFO L142 QuantifierPusher]: treesize reduction 75, result has 27.9 percent of original size [2021-03-26 09:55:18,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 09:55:18,071 INFO L142 QuantifierPusher]: treesize reduction 48, result has 36.8 percent of original size [2021-03-26 09:55:18,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 09:55:18,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:18,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:18,098 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 09:55:18,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834631470] [2021-03-26 09:55:18,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:18,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:55:18,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051781963] [2021-03-26 09:55:18,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:55:18,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:55:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:55:18,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 209 [2021-03-26 09:55:18,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 154.33333333333334) internal successors, (926), 6 states have internal predecessors, (926), 0 states have call successors, (0), 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 09:55:18,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:18,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 209 [2021-03-26 09:55:18,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:18,501 INFO L129 PetriNetUnfolder]: 2089/3093 cut-off events. [2021-03-26 09:55:18,501 INFO L130 PetriNetUnfolder]: For 4710/5000 co-relation queries the response was YES. [2021-03-26 09:55:18,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11476 conditions, 3093 events. 2089/3093 cut-off events. For 4710/5000 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16258 event pairs, 175 based on Foata normal form. 117/3170 useless extension candidates. Maximal degree in co-relation 11459. Up to 2210 conditions per place. [2021-03-26 09:55:18,518 INFO L132 encePairwiseOnDemand]: 195/209 looper letters, 27 selfloop transitions, 44 changer transitions 4/87 dead transitions. [2021-03-26 09:55:18,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 595 flow [2021-03-26 09:55:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 09:55:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 09:55:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1300 transitions. [2021-03-26 09:55:18,521 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.777511961722488 [2021-03-26 09:55:18,521 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1300 transitions. [2021-03-26 09:55:18,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1300 transitions. [2021-03-26 09:55:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:18,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1300 transitions. [2021-03-26 09:55:18,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.5) internal successors, (1300), 8 states have internal predecessors, (1300), 0 states have call successors, (0), 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 09:55:18,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 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 09:55:18,525 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 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 09:55:18,525 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 181 flow. Second operand 8 states and 1300 transitions. [2021-03-26 09:55:18,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 595 flow [2021-03-26 09:55:18,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 584 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:18,537 INFO L241 Difference]: Finished difference. Result has 54 places, 75 transitions, 547 flow [2021-03-26 09:55:18,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=54, PETRI_TRANSITIONS=75} [2021-03-26 09:55:18,537 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2021-03-26 09:55:18,537 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:18,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 75 transitions, 547 flow [2021-03-26 09:55:18,537 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 75 transitions, 547 flow [2021-03-26 09:55:18,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 75 transitions, 547 flow [2021-03-26 09:55:18,693 INFO L129 PetriNetUnfolder]: 1201/1933 cut-off events. [2021-03-26 09:55:18,693 INFO L130 PetriNetUnfolder]: For 3846/4225 co-relation queries the response was YES. [2021-03-26 09:55:18,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 1933 events. 1201/1933 cut-off events. For 3846/4225 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11201 event pairs, 122 based on Foata normal form. 5/1845 useless extension candidates. Maximal degree in co-relation 8193. Up to 935 conditions per place. [2021-03-26 09:55:18,710 INFO L142 LiptonReduction]: Number of co-enabled transitions 802 [2021-03-26 09:55:19,046 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-26 09:55:19,234 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:55:19,355 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:55:19,680 INFO L154 LiptonReduction]: Checked pairs total: 1388 [2021-03-26 09:55:19,681 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:19,681 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1144 [2021-03-26 09:55:19,681 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 75 transitions, 551 flow [2021-03-26 09:55:19,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.33333333333334) internal successors, (926), 6 states have internal predecessors, (926), 0 states have call successors, (0), 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 09:55:19,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:19,682 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 09:55:19,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:55:19,682 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 895125180, now seen corresponding path program 2 times [2021-03-26 09:55:19,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:19,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744587518] [2021-03-26 09:55:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:19,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:19,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:19,731 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:55:19,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:55:19,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:19,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:19,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:19,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:19,738 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 09:55:19,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744587518] [2021-03-26 09:55:19,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:19,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:55:19,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766491695] [2021-03-26 09:55:19,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:55:19,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:55:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:55:19,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-26 09:55:19,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 75 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 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 09:55:19,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:19,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-26 09:55:19,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:19,894 INFO L129 PetriNetUnfolder]: 825/1419 cut-off events. [2021-03-26 09:55:19,894 INFO L130 PetriNetUnfolder]: For 4417/4721 co-relation queries the response was YES. [2021-03-26 09:55:19,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 1419 events. 825/1419 cut-off events. For 4417/4721 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7943 event pairs, 64 based on Foata normal form. 257/1647 useless extension candidates. Maximal degree in co-relation 6631. Up to 659 conditions per place. [2021-03-26 09:55:19,904 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 9 selfloop transitions, 21 changer transitions 7/80 dead transitions. [2021-03-26 09:55:19,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 672 flow [2021-03-26 09:55:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:55:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:55:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2021-03-26 09:55:19,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2021-03-26 09:55:19,906 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2021-03-26 09:55:19,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2021-03-26 09:55:19,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:19,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2021-03-26 09:55:19,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 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 09:55:19,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 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 09:55:19,910 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 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 09:55:19,910 INFO L185 Difference]: Start difference. First operand has 53 places, 75 transitions, 551 flow. Second operand 6 states and 1077 transitions. [2021-03-26 09:55:19,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 672 flow [2021-03-26 09:55:19,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 534 flow, removed 64 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:19,931 INFO L241 Difference]: Finished difference. Result has 56 places, 70 transitions, 485 flow [2021-03-26 09:55:19,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=56, PETRI_TRANSITIONS=70} [2021-03-26 09:55:19,931 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2021-03-26 09:55:19,931 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:19,931 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 70 transitions, 485 flow [2021-03-26 09:55:19,931 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 70 transitions, 485 flow [2021-03-26 09:55:19,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 70 transitions, 485 flow [2021-03-26 09:55:20,023 INFO L129 PetriNetUnfolder]: 698/1269 cut-off events. [2021-03-26 09:55:20,023 INFO L130 PetriNetUnfolder]: For 4584/5045 co-relation queries the response was YES. [2021-03-26 09:55:20,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 1269 events. 698/1269 cut-off events. For 4584/5045 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7679 event pairs, 100 based on Foata normal form. 71/1307 useless extension candidates. Maximal degree in co-relation 5427. Up to 587 conditions per place. [2021-03-26 09:55:20,037 INFO L142 LiptonReduction]: Number of co-enabled transitions 812 [2021-03-26 09:55:20,266 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-26 09:55:20,266 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:20,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 335 [2021-03-26 09:55:20,267 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 68 transitions, 465 flow [2021-03-26 09:55:20,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 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 09:55:20,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:20,267 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:20,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:55:20,268 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 856052113, now seen corresponding path program 1 times [2021-03-26 09:55:20,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:20,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280394739] [2021-03-26 09:55:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:20,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:20,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:20,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:20,313 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 09:55:20,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280394739] [2021-03-26 09:55:20,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:20,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:20,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207217252] [2021-03-26 09:55:20,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:20,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:20,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2021-03-26 09:55:20,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 68 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:20,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:20,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2021-03-26 09:55:20,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:20,472 INFO L129 PetriNetUnfolder]: 814/1416 cut-off events. [2021-03-26 09:55:20,472 INFO L130 PetriNetUnfolder]: For 4814/5143 co-relation queries the response was YES. [2021-03-26 09:55:20,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 1416 events. 814/1416 cut-off events. For 4814/5143 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7877 event pairs, 121 based on Foata normal form. 104/1468 useless extension candidates. Maximal degree in co-relation 6086. Up to 721 conditions per place. [2021-03-26 09:55:20,480 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 10 selfloop transitions, 2 changer transitions 6/61 dead transitions. [2021-03-26 09:55:20,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 432 flow [2021-03-26 09:55:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:55:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:55:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 736 transitions. [2021-03-26 09:55:20,482 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2021-03-26 09:55:20,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 736 transitions. [2021-03-26 09:55:20,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 736 transitions. [2021-03-26 09:55:20,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:20,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 736 transitions. [2021-03-26 09:55:20,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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 09:55:20,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 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 09:55:20,484 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 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 09:55:20,485 INFO L185 Difference]: Start difference. First operand has 56 places, 68 transitions, 465 flow. Second operand 4 states and 736 transitions. [2021-03-26 09:55:20,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 432 flow [2021-03-26 09:55:20,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 364 flow, removed 27 selfloop flow, removed 5 redundant places. [2021-03-26 09:55:20,501 INFO L241 Difference]: Finished difference. Result has 52 places, 55 transitions, 313 flow [2021-03-26 09:55:20,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2021-03-26 09:55:20,501 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-26 09:55:20,501 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:20,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 313 flow [2021-03-26 09:55:20,502 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 313 flow [2021-03-26 09:55:20,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 313 flow [2021-03-26 09:55:20,573 INFO L129 PetriNetUnfolder]: 550/1037 cut-off events. [2021-03-26 09:55:20,573 INFO L130 PetriNetUnfolder]: For 1268/1356 co-relation queries the response was YES. [2021-03-26 09:55:20,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 1037 events. 550/1037 cut-off events. For 1268/1356 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6196 event pairs, 154 based on Foata normal form. 13/1005 useless extension candidates. Maximal degree in co-relation 3451. Up to 501 conditions per place. [2021-03-26 09:55:20,581 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-26 09:55:20,715 INFO L154 LiptonReduction]: Checked pairs total: 614 [2021-03-26 09:55:20,716 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:20,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 215 [2021-03-26 09:55:20,716 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 316 flow [2021-03-26 09:55:20,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:20,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:20,717 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:20,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:55:20,717 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash -549078959, now seen corresponding path program 2 times [2021-03-26 09:55:20,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:20,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153078234] [2021-03-26 09:55:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:20,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:20,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:20,774 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:55:20,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:55:20,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:20,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:20,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:20,782 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 09:55:20,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153078234] [2021-03-26 09:55:20,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:20,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:55:20,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993298022] [2021-03-26 09:55:20,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:55:20,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:20,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:55:20,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:55:20,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-26 09:55:20,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 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 09:55:20,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:20,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-26 09:55:20,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:20,899 INFO L129 PetriNetUnfolder]: 427/839 cut-off events. [2021-03-26 09:55:20,900 INFO L130 PetriNetUnfolder]: For 1542/1858 co-relation queries the response was YES. [2021-03-26 09:55:20,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 839 events. 427/839 cut-off events. For 1542/1858 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4651 event pairs, 37 based on Foata normal form. 166/984 useless extension candidates. Maximal degree in co-relation 3187. Up to 365 conditions per place. [2021-03-26 09:55:20,905 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 22 changer transitions 4/68 dead transitions. [2021-03-26 09:55:20,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 482 flow [2021-03-26 09:55:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:55:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:55:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1262 transitions. [2021-03-26 09:55:20,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8544346648612051 [2021-03-26 09:55:20,907 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1262 transitions. [2021-03-26 09:55:20,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1262 transitions. [2021-03-26 09:55:20,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:20,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1262 transitions. [2021-03-26 09:55:20,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.28571428571428) internal successors, (1262), 7 states have internal predecessors, (1262), 0 states have call successors, (0), 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 09:55:20,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 09:55:20,911 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 09:55:20,911 INFO L185 Difference]: Start difference. First operand has 52 places, 55 transitions, 316 flow. Second operand 7 states and 1262 transitions. [2021-03-26 09:55:20,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 482 flow [2021-03-26 09:55:20,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:55:20,915 INFO L241 Difference]: Finished difference. Result has 60 places, 64 transitions, 464 flow [2021-03-26 09:55:20,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2021-03-26 09:55:20,915 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2021-03-26 09:55:20,915 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:20,915 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 64 transitions, 464 flow [2021-03-26 09:55:20,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 64 transitions, 464 flow [2021-03-26 09:55:20,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 64 transitions, 464 flow [2021-03-26 09:55:20,972 INFO L129 PetriNetUnfolder]: 395/808 cut-off events. [2021-03-26 09:55:20,972 INFO L130 PetriNetUnfolder]: For 2113/2292 co-relation queries the response was YES. [2021-03-26 09:55:20,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 808 events. 395/808 cut-off events. For 2113/2292 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4813 event pairs, 59 based on Foata normal form. 19/812 useless extension candidates. Maximal degree in co-relation 3348. Up to 371 conditions per place. [2021-03-26 09:55:20,978 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-26 09:55:21,095 INFO L154 LiptonReduction]: Checked pairs total: 861 [2021-03-26 09:55:21,095 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:21,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 180 [2021-03-26 09:55:21,096 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 454 flow [2021-03-26 09:55:21,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 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 09:55:21,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:21,096 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:21,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:55:21,096 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1136202961, now seen corresponding path program 1 times [2021-03-26 09:55:21,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:21,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377104869] [2021-03-26 09:55:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:21,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:21,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:21,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:21,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:21,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:21,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:21,134 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 09:55:21,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377104869] [2021-03-26 09:55:21,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:21,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:21,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80106620] [2021-03-26 09:55:21,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:21,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:21,135 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 211 [2021-03-26 09:55:21,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 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 09:55:21,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:21,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 211 [2021-03-26 09:55:21,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:21,264 INFO L129 PetriNetUnfolder]: 579/1119 cut-off events. [2021-03-26 09:55:21,265 INFO L130 PetriNetUnfolder]: For 2834/2975 co-relation queries the response was YES. [2021-03-26 09:55:21,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 1119 events. 579/1119 cut-off events. For 2834/2975 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6507 event pairs, 56 based on Foata normal form. 22/1112 useless extension candidates. Maximal degree in co-relation 4402. Up to 538 conditions per place. [2021-03-26 09:55:21,271 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 6 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2021-03-26 09:55:21,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 449 flow [2021-03-26 09:55:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:55:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:55:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-03-26 09:55:21,273 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8898104265402843 [2021-03-26 09:55:21,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-03-26 09:55:21,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-03-26 09:55:21,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:21,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-03-26 09:55:21,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 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 09:55:21,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 09:55:21,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 09:55:21,276 INFO L185 Difference]: Start difference. First operand has 60 places, 63 transitions, 454 flow. Second operand 4 states and 751 transitions. [2021-03-26 09:55:21,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 449 flow [2021-03-26 09:55:21,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 404 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:21,285 INFO L241 Difference]: Finished difference. Result has 59 places, 60 transitions, 380 flow [2021-03-26 09:55:21,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2021-03-26 09:55:21,286 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2021-03-26 09:55:21,286 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:21,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 380 flow [2021-03-26 09:55:21,286 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 60 transitions, 380 flow [2021-03-26 09:55:21,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 380 flow [2021-03-26 09:55:21,358 INFO L129 PetriNetUnfolder]: 381/825 cut-off events. [2021-03-26 09:55:21,358 INFO L130 PetriNetUnfolder]: For 1266/1307 co-relation queries the response was YES. [2021-03-26 09:55:21,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 825 events. 381/825 cut-off events. For 1266/1307 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5059 event pairs, 68 based on Foata normal form. 7/816 useless extension candidates. Maximal degree in co-relation 2941. Up to 358 conditions per place. [2021-03-26 09:55:21,366 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 09:55:21,963 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 09:55:22,219 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 09:55:23,405 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 09:55:23,913 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 09:55:23,967 INFO L154 LiptonReduction]: Checked pairs total: 554 [2021-03-26 09:55:23,967 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:23,979 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2693 [2021-03-26 09:55:23,980 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 383 flow [2021-03-26 09:55:23,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 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 09:55:23,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:23,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:23,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:55:23,981 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -506191855, now seen corresponding path program 2 times [2021-03-26 09:55:23,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:23,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228193570] [2021-03-26 09:55:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:24,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 09:55:24,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:24,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:24,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:24,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:24,126 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:55:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:55:24,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:24,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:24,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:24,137 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 09:55:24,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228193570] [2021-03-26 09:55:24,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:24,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 09:55:24,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628679668] [2021-03-26 09:55:24,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 09:55:24,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 09:55:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-26 09:55:24,138 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 212 [2021-03-26 09:55:24,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 383 flow. Second operand has 8 states, 8 states have (on average 153.25) internal successors, (1226), 8 states have internal predecessors, (1226), 0 states have call successors, (0), 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 09:55:24,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:24,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 212 [2021-03-26 09:55:24,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:24,339 INFO L129 PetriNetUnfolder]: 588/1101 cut-off events. [2021-03-26 09:55:24,339 INFO L130 PetriNetUnfolder]: For 2274/2351 co-relation queries the response was YES. [2021-03-26 09:55:24,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 1101 events. 588/1101 cut-off events. For 2274/2351 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6359 event pairs, 34 based on Foata normal form. 74/1148 useless extension candidates. Maximal degree in co-relation 4553. Up to 436 conditions per place. [2021-03-26 09:55:24,344 INFO L132 encePairwiseOnDemand]: 204/212 looper letters, 21 selfloop transitions, 25 changer transitions 14/84 dead transitions. [2021-03-26 09:55:24,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 636 flow [2021-03-26 09:55:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 09:55:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 09:55:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1420 transitions. [2021-03-26 09:55:24,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7442348008385744 [2021-03-26 09:55:24,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1420 transitions. [2021-03-26 09:55:24,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1420 transitions. [2021-03-26 09:55:24,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:24,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1420 transitions. [2021-03-26 09:55:24,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.77777777777777) internal successors, (1420), 9 states have internal predecessors, (1420), 0 states have call successors, (0), 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 09:55:24,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 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 09:55:24,377 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 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 09:55:24,377 INFO L185 Difference]: Start difference. First operand has 59 places, 60 transitions, 383 flow. Second operand 9 states and 1420 transitions. [2021-03-26 09:55:24,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 636 flow [2021-03-26 09:55:24,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 598 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-26 09:55:24,388 INFO L241 Difference]: Finished difference. Result has 68 places, 60 transitions, 422 flow [2021-03-26 09:55:24,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=422, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2021-03-26 09:55:24,388 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2021-03-26 09:55:24,388 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:24,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 60 transitions, 422 flow [2021-03-26 09:55:24,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 60 transitions, 422 flow [2021-03-26 09:55:24,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 422 flow [2021-03-26 09:55:24,428 INFO L129 PetriNetUnfolder]: 258/542 cut-off events. [2021-03-26 09:55:24,429 INFO L130 PetriNetUnfolder]: For 1047/1088 co-relation queries the response was YES. [2021-03-26 09:55:24,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 542 events. 258/542 cut-off events. For 1047/1088 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2966 event pairs, 40 based on Foata normal form. 9/540 useless extension candidates. Maximal degree in co-relation 2069. Up to 230 conditions per place. [2021-03-26 09:55:24,433 INFO L142 LiptonReduction]: Number of co-enabled transitions 496 [2021-03-26 09:55:24,708 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:55:24,840 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:55:25,181 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-26 09:55:25,333 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-26 09:55:25,350 INFO L154 LiptonReduction]: Checked pairs total: 486 [2021-03-26 09:55:25,350 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:25,350 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 962 [2021-03-26 09:55:25,350 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 418 flow [2021-03-26 09:55:25,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.25) internal successors, (1226), 8 states have internal predecessors, (1226), 0 states have call successors, (0), 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 09:55:25,351 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:25,351 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:25,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 09:55:25,351 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1539749377, now seen corresponding path program 1 times [2021-03-26 09:55:25,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:25,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887955715] [2021-03-26 09:55:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:25,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:25,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:25,386 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:25,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:25,399 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 09:55:25,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887955715] [2021-03-26 09:55:25,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:25,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:25,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196251338] [2021-03-26 09:55:25,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:25,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:25,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-03-26 09:55:25,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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 09:55:25,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:25,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-03-26 09:55:25,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:25,512 INFO L129 PetriNetUnfolder]: 454/921 cut-off events. [2021-03-26 09:55:25,512 INFO L130 PetriNetUnfolder]: For 2134/2241 co-relation queries the response was YES. [2021-03-26 09:55:25,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 921 events. 454/921 cut-off events. For 2134/2241 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5620 event pairs, 18 based on Foata normal form. 23/924 useless extension candidates. Maximal degree in co-relation 3885. Up to 396 conditions per place. [2021-03-26 09:55:25,517 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 17 selfloop transitions, 20 changer transitions 14/85 dead transitions. [2021-03-26 09:55:25,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 665 flow [2021-03-26 09:55:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:55:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:55:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 886 transitions. [2021-03-26 09:55:25,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8280373831775701 [2021-03-26 09:55:25,519 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 886 transitions. [2021-03-26 09:55:25,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 886 transitions. [2021-03-26 09:55:25,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:25,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 886 transitions. [2021-03-26 09:55:25,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 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 09:55:25,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 09:55:25,523 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 09:55:25,523 INFO L185 Difference]: Start difference. First operand has 63 places, 58 transitions, 418 flow. Second operand 5 states and 886 transitions. [2021-03-26 09:55:25,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 665 flow [2021-03-26 09:55:25,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 578 flow, removed 23 selfloop flow, removed 9 redundant places. [2021-03-26 09:55:25,535 INFO L241 Difference]: Finished difference. Result has 60 places, 71 transitions, 500 flow [2021-03-26 09:55:25,535 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=60, PETRI_TRANSITIONS=71} [2021-03-26 09:55:25,535 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2021-03-26 09:55:25,535 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:25,535 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 71 transitions, 500 flow [2021-03-26 09:55:25,535 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 71 transitions, 500 flow [2021-03-26 09:55:25,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 71 transitions, 500 flow [2021-03-26 09:55:25,613 INFO L129 PetriNetUnfolder]: 392/828 cut-off events. [2021-03-26 09:55:25,614 INFO L130 PetriNetUnfolder]: For 1560/1622 co-relation queries the response was YES. [2021-03-26 09:55:25,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 828 events. 392/828 cut-off events. For 1560/1622 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5276 event pairs, 24 based on Foata normal form. 20/836 useless extension candidates. Maximal degree in co-relation 3076. Up to 351 conditions per place. [2021-03-26 09:55:25,619 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-26 09:55:25,669 INFO L154 LiptonReduction]: Checked pairs total: 228 [2021-03-26 09:55:25,669 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:25,669 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-26 09:55:25,670 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 500 flow [2021-03-26 09:55:25,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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 09:55:25,670 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:25,670 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:25,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 09:55:25,670 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 709960723, now seen corresponding path program 1 times [2021-03-26 09:55:25,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:25,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481503213] [2021-03-26 09:55:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:25,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:25,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:25,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:25,736 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:25,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:25,746 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 09:55:25,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481503213] [2021-03-26 09:55:25,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:25,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:55:25,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307668887] [2021-03-26 09:55:25,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:55:25,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:55:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:55:25,749 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-03-26 09:55:25,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 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 09:55:25,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:25,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-03-26 09:55:25,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:25,867 INFO L129 PetriNetUnfolder]: 561/1149 cut-off events. [2021-03-26 09:55:25,867 INFO L130 PetriNetUnfolder]: For 2608/2709 co-relation queries the response was YES. [2021-03-26 09:55:25,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 1149 events. 561/1149 cut-off events. For 2608/2709 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7489 event pairs, 19 based on Foata normal form. 31/1162 useless extension candidates. Maximal degree in co-relation 4682. Up to 497 conditions per place. [2021-03-26 09:55:25,875 INFO L132 encePairwiseOnDemand]: 208/214 looper letters, 14 selfloop transitions, 3 changer transitions 45/93 dead transitions. [2021-03-26 09:55:25,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 781 flow [2021-03-26 09:55:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:55:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:55:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1060 transitions. [2021-03-26 09:55:25,877 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8255451713395638 [2021-03-26 09:55:25,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1060 transitions. [2021-03-26 09:55:25,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1060 transitions. [2021-03-26 09:55:25,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:25,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1060 transitions. [2021-03-26 09:55:25,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.66666666666666) internal successors, (1060), 6 states have internal predecessors, (1060), 0 states have call successors, (0), 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 09:55:25,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 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 09:55:25,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 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 09:55:25,891 INFO L185 Difference]: Start difference. First operand has 60 places, 71 transitions, 500 flow. Second operand 6 states and 1060 transitions. [2021-03-26 09:55:25,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 781 flow [2021-03-26 09:55:25,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 772 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 09:55:25,908 INFO L241 Difference]: Finished difference. Result has 65 places, 48 transitions, 314 flow [2021-03-26 09:55:25,908 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2021-03-26 09:55:25,908 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2021-03-26 09:55:25,908 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:25,909 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 48 transitions, 314 flow [2021-03-26 09:55:25,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 48 transitions, 314 flow [2021-03-26 09:55:25,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 48 transitions, 314 flow [2021-03-26 09:55:25,931 INFO L129 PetriNetUnfolder]: 155/354 cut-off events. [2021-03-26 09:55:25,931 INFO L130 PetriNetUnfolder]: For 654/686 co-relation queries the response was YES. [2021-03-26 09:55:25,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 354 events. 155/354 cut-off events. For 654/686 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1891 event pairs, 16 based on Foata normal form. 10/360 useless extension candidates. Maximal degree in co-relation 1274. Up to 140 conditions per place. [2021-03-26 09:55:25,933 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 09:55:26,488 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 09:55:26,740 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 09:55:28,041 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 09:55:28,585 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 09:55:29,047 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-26 09:55:29,191 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-26 09:55:30,121 WARN L205 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-26 09:55:30,442 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 09:55:30,468 INFO L154 LiptonReduction]: Checked pairs total: 306 [2021-03-26 09:55:30,468 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 09:55:30,469 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4561 [2021-03-26 09:55:30,469 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 319 flow [2021-03-26 09:55:30,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 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 09:55:30,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:30,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:30,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 09:55:30,470 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1073899691, now seen corresponding path program 2 times [2021-03-26 09:55:30,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:30,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597015453] [2021-03-26 09:55:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:30,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:55:30,551 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size [2021-03-26 09:55:30,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 09:55:30,585 INFO L142 QuantifierPusher]: treesize reduction 58, result has 59.2 percent of original size [2021-03-26 09:55:30,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-03-26 09:55:30,630 INFO L142 QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size [2021-03-26 09:55:30,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 09:55:30,643 INFO L142 QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size [2021-03-26 09:55:30,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 09:55:30,653 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 09:55:30,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597015453] [2021-03-26 09:55:30,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:30,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:55:30,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503071482] [2021-03-26 09:55:30,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:55:30,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:30,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:55:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:55:30,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 219 [2021-03-26 09:55:30,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 0 states have call successors, (0), 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 09:55:30,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:30,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 219 [2021-03-26 09:55:30,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:30,793 INFO L129 PetriNetUnfolder]: 233/516 cut-off events. [2021-03-26 09:55:30,793 INFO L130 PetriNetUnfolder]: For 1181/1184 co-relation queries the response was YES. [2021-03-26 09:55:30,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 516 events. 233/516 cut-off events. For 1181/1184 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2970 event pairs, 14 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 1993. Up to 226 conditions per place. [2021-03-26 09:55:30,795 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 3 selfloop transitions, 4 changer transitions 6/49 dead transitions. [2021-03-26 09:55:30,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 360 flow [2021-03-26 09:55:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:55:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:55:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2021-03-26 09:55:30,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7328767123287672 [2021-03-26 09:55:30,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2021-03-26 09:55:30,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2021-03-26 09:55:30,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:30,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2021-03-26 09:55:30,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 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 09:55:30,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 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 09:55:30,801 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 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 09:55:30,801 INFO L185 Difference]: Start difference. First operand has 60 places, 46 transitions, 319 flow. Second operand 6 states and 963 transitions. [2021-03-26 09:55:30,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 360 flow [2021-03-26 09:55:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 307 flow, removed 17 selfloop flow, removed 9 redundant places. [2021-03-26 09:55:30,809 INFO L241 Difference]: Finished difference. Result has 57 places, 43 transitions, 265 flow [2021-03-26 09:55:30,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2021-03-26 09:55:30,809 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 09:55:30,809 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:30,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 43 transitions, 265 flow [2021-03-26 09:55:30,809 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 265 flow [2021-03-26 09:55:30,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 265 flow [2021-03-26 09:55:30,828 INFO L129 PetriNetUnfolder]: 106/271 cut-off events. [2021-03-26 09:55:30,829 INFO L130 PetriNetUnfolder]: For 443/457 co-relation queries the response was YES. [2021-03-26 09:55:30,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 271 events. 106/271 cut-off events. For 443/457 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1423 event pairs, 11 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 965. Up to 117 conditions per place. [2021-03-26 09:55:30,830 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 09:55:31,453 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 179 [2021-03-26 09:55:31,738 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-26 09:55:32,985 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 09:55:33,551 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 09:55:33,770 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 09:55:34,129 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-26 09:55:34,249 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 09:55:34,435 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 09:55:34,816 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 09:55:34,934 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 09:55:35,111 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 09:55:35,488 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 09:55:35,608 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 09:55:35,611 INFO L154 LiptonReduction]: Checked pairs total: 81 [2021-03-26 09:55:35,611 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 09:55:35,611 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4802 [2021-03-26 09:55:35,611 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 276 flow [2021-03-26 09:55:35,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 0 states have call successors, (0), 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 09:55:35,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:35,612 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 09:55:35,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 09:55:35,612 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:35,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1944053460, now seen corresponding path program 1 times [2021-03-26 09:55:35,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:35,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248161151] [2021-03-26 09:55:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:55:35,632 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:55:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:55:35,655 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:55:35,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:55:35,692 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:55:35,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 09:55:35,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:55:35 BasicIcfg [2021-03-26 09:55:35,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:55:35,781 INFO L168 Benchmark]: Toolchain (without parser) took 26822.11 ms. Allocated memory was 425.7 MB in the beginning and 1.1 GB in the end (delta: 685.8 MB). Free memory was 389.4 MB in the beginning and 697.1 MB in the end (delta: -307.7 MB). Peak memory consumption was 381.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,782 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 425.7 MB. Free memory was 407.2 MB in the beginning and 407.1 MB in the end (delta: 74.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:55:35,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.88 ms. Allocated memory is still 425.7 MB. Free memory was 389.2 MB in the beginning and 385.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.43 ms. Allocated memory is still 425.7 MB. Free memory was 384.0 MB in the beginning and 381.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,784 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 ms. Allocated memory is still 425.7 MB. Free memory was 381.9 MB in the beginning and 378.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,784 INFO L168 Benchmark]: RCFGBuilder took 1693.63 ms. Allocated memory is still 425.7 MB. Free memory was 378.7 MB in the beginning and 245.6 MB in the end (delta: 133.1 MB). Peak memory consumption was 135.2 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,785 INFO L168 Benchmark]: TraceAbstraction took 24635.42 ms. Allocated memory was 425.7 MB in the beginning and 1.1 GB in the end (delta: 685.8 MB). Free memory was 245.6 MB in the beginning and 697.1 MB in the end (delta: -451.5 MB). Peak memory consumption was 236.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:35,786 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.41 ms. Allocated memory is still 425.7 MB. Free memory was 407.2 MB in the beginning and 407.1 MB in the end (delta: 74.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 422.88 ms. Allocated memory is still 425.7 MB. Free memory was 389.2 MB in the beginning and 385.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 39.43 ms. Allocated memory is still 425.7 MB. Free memory was 384.0 MB in the beginning and 381.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.01 ms. Allocated memory is still 425.7 MB. Free memory was 381.9 MB in the beginning and 378.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1693.63 ms. Allocated memory is still 425.7 MB. Free memory was 378.7 MB in the beginning and 245.6 MB in the end (delta: 133.1 MB). Peak memory consumption was 135.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24635.42 ms. Allocated memory was 425.7 MB in the beginning and 1.1 GB in the end (delta: 685.8 MB). Free memory was 245.6 MB in the beginning and 697.1 MB in the end (delta: -451.5 MB). Peak memory consumption was 236.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2605.7ms, 125 PlacesBefore, 61 PlacesAfterwards, 114 TransitionsBefore, 49 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4176 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2575, positive: 2482, positive conditional: 2482, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2575, positive: 2482, positive conditional: 0, positive unconditional: 2482, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2575, positive: 2482, positive conditional: 0, positive unconditional: 2482, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1816, positive: 1777, positive conditional: 0, positive unconditional: 1777, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1816, positive: 1765, positive conditional: 0, positive unconditional: 1765, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 290, negative conditional: 0, negative unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2575, positive: 705, positive conditional: 0, positive unconditional: 705, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1816, unknown conditional: 0, unknown unconditional: 1816] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1777, Positive conditional cache size: 0, Positive unconditional cache size: 1777, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1293.7ms, 57 PlacesBefore, 42 PlacesAfterwards, 46 TransitionsBefore, 31 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 2220 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1023, positive: 913, positive conditional: 913, positive unconditional: 0, negative: 110, negative conditional: 110, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1023, positive: 913, positive conditional: 47, positive unconditional: 866, negative: 110, negative conditional: 4, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1023, positive: 913, positive conditional: 47, positive unconditional: 866, negative: 110, negative conditional: 4, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 190, positive: 173, positive conditional: 14, positive unconditional: 159, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 190, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 199, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 177, negative conditional: 10, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1023, positive: 740, positive conditional: 33, positive unconditional: 707, negative: 93, negative conditional: 3, negative unconditional: 90, unknown: 190, unknown conditional: 15, unknown unconditional: 175] , Statistics on independence cache: Total cache size (in pairs): 2006, Positive cache size: 1950, Positive conditional cache size: 14, Positive unconditional cache size: 1936, Negative cache size: 56, Negative conditional cache size: 1, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1366.0ms, 46 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 564 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, positive: 234, positive conditional: 234, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 264, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 2031, Positive cache size: 1974, Positive conditional cache size: 14, Positive unconditional cache size: 1960, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.1ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 92, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1977, Positive conditional cache size: 14, Positive unconditional cache size: 1963, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.3ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1977, Positive conditional cache size: 14, Positive unconditional cache size: 1963, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 413 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, positive: 149, positive conditional: 41, positive unconditional: 108, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 149, positive conditional: 41, positive unconditional: 108, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 165, positive: 142, positive conditional: 35, positive unconditional: 107, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2041, Positive cache size: 1984, Positive conditional cache size: 20, Positive unconditional cache size: 1964, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1143.1ms, 54 PlacesBefore, 53 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1388 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, positive: 182, positive conditional: 182, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, positive: 182, positive conditional: 20, positive unconditional: 162, negative: 28, negative conditional: 6, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 182, positive conditional: 20, positive unconditional: 162, negative: 28, negative conditional: 6, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, positive: 178, positive conditional: 18, positive unconditional: 160, negative: 25, negative conditional: 3, negative unconditional: 22, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2048, Positive cache size: 1988, Positive conditional cache size: 22, Positive unconditional cache size: 1966, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 81 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 334.4ms, 56 PlacesBefore, 56 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, positive: 203, positive conditional: 203, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, positive: 203, positive conditional: 93, positive unconditional: 110, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 219, positive: 203, positive conditional: 93, positive unconditional: 110, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 219, positive: 198, positive conditional: 89, positive unconditional: 109, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2053, Positive cache size: 1993, Positive conditional cache size: 26, Positive unconditional cache size: 1967, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 213.7ms, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 614 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 280, positive: 264, positive conditional: 264, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 280, positive: 264, positive conditional: 53, positive unconditional: 211, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 280, positive: 264, positive conditional: 53, positive unconditional: 211, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 280, positive: 260, positive conditional: 53, positive unconditional: 207, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2057, Positive cache size: 1997, Positive conditional cache size: 26, Positive unconditional cache size: 1971, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 179.7ms, 60 PlacesBefore, 60 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 861 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, positive: 205, positive conditional: 205, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, positive: 205, positive conditional: 58, positive unconditional: 147, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, positive: 205, positive conditional: 58, positive unconditional: 147, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 227, positive: 201, positive conditional: 54, positive unconditional: 147, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2061, Positive cache size: 2001, Positive conditional cache size: 30, Positive unconditional cache size: 1971, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2693.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 554 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, positive: 222, positive conditional: 92, positive unconditional: 130, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, positive: 222, positive conditional: 92, positive unconditional: 130, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 236, positive: 221, positive conditional: 92, positive unconditional: 129, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 2002, Positive conditional cache size: 30, Positive unconditional cache size: 1972, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 961.2ms, 68 PlacesBefore, 63 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 486 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, positive: 186, positive conditional: 186, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, positive: 186, positive conditional: 60, positive unconditional: 126, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 186, positive conditional: 60, positive unconditional: 126, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, positive: 186, positive conditional: 60, positive unconditional: 126, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 2002, Positive conditional cache size: 30, Positive unconditional cache size: 1972, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.6ms, 60 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 228 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 36, positive conditional: 6, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 6, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 36, positive conditional: 6, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 2002, Positive conditional cache size: 30, Positive unconditional cache size: 1972, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4559.7ms, 65 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, positive: 142, positive conditional: 62, positive unconditional: 80, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 142, positive conditional: 62, positive unconditional: 80, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 150, positive: 140, positive conditional: 62, positive unconditional: 78, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 2004, Positive conditional cache size: 30, Positive unconditional cache size: 1974, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4801.5ms, 57 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 81 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, positive: 81, positive conditional: 74, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 74, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 81, positive: 76, positive conditional: 71, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2069, Positive cache size: 2009, Positive conditional cache size: 33, Positive unconditional cache size: 1976, Negative cache size: 60, Negative conditional cache size: 4, Negative unconditional cache size: 56, Eliminated conditions: 4 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t333; [L872] FCALL, FORK 0 pthread_create(&t333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t334; [L874] FCALL, FORK 0 pthread_create(&t334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t335; [L876] FCALL, FORK 0 pthread_create(&t335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t336; [L878] FCALL, FORK 0 pthread_create(&t336, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 y = 1 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L884] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24417.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2313.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2672.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 106 SDtfs, 101 SDslu, 100 SDs, 0 SdLazy, 379 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 354.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 376.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=6, InterpolantAutomatonStates: 74, 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: 44.7ms SsaConstructionTime, 411.4ms SatisfiabilityAnalysisTime, 896.3ms InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...