/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:22:53,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:22:53,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:22:53,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:22:53,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:22:53,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:22:53,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:22:53,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:22:53,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:22:53,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:22:53,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:22:53,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:22:53,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:22:53,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:22:53,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:22:53,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:22:53,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:22:53,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:22:53,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:22:53,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:22:53,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:22:53,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:22:53,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:22:53,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:22:53,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:22:53,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:22:53,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:22:53,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:22:53,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:22:53,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:22:53,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:22:53,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:22:53,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:22:53,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:22:53,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:22:53,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:22:53,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:22:53,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:22:53,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:22:53,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:22:53,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:22:53,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:22:53,721 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:22:53,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:22:53,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:22:53,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:22:53,722 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:22:53,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:22:53,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:22:53,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:22:53,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:22:53,724 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:22:53,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:22:53,725 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:22:53,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:22:53,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:22:53,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:22:53,970 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:22:53,971 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:22:53,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc.i [2021-03-26 00:22:54,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0562bd391/98ef9e5ad55d42acbf7c3952b1d633cd/FLAGd0a177776 [2021-03-26 00:22:54,396 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:22:54,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc.i [2021-03-26 00:22:54,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0562bd391/98ef9e5ad55d42acbf7c3952b1d633cd/FLAGd0a177776 [2021-03-26 00:22:54,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0562bd391/98ef9e5ad55d42acbf7c3952b1d633cd [2021-03-26 00:22:54,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:22:54,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:22:54,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:22:54,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:22:54,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:22:54,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:22:54" (1/1) ... [2021-03-26 00:22:54,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f34610b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:54, skipping insertion in model container [2021-03-26 00:22:54,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:22:54" (1/1) ... [2021-03-26 00:22:54,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:22:54,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:22:54,894 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/mix053_power.oepc.i[951,964] [2021-03-26 00:22:55,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:22:55,067 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:22:55,075 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/mix053_power.oepc.i[951,964] [2021-03-26 00:22:55,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:22:55,180 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:22:55,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55 WrapperNode [2021-03-26 00:22:55,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:22:55,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:22:55,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:22:55,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:22:55,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:22:55,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:22:55,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:22:55,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:22:55,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... [2021-03-26 00:22:55,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:22:55,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:22:55,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:22:55,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:22:55,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:22:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:22:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:22:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:22:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:22:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:22:55,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:22:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:22:55,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:22:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:22:55,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:22:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:22:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:22:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:22:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:22:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:22:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:22:55,295 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:22:56,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:22:56,897 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:22:56,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:22:56 BoogieIcfgContainer [2021-03-26 00:22:56,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:22:56,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:22:56,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:22:56,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:22:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:22:54" (1/3) ... [2021-03-26 00:22:56,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050c4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:22:56, skipping insertion in model container [2021-03-26 00:22:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:55" (2/3) ... [2021-03-26 00:22:56,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050c4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:22:56, skipping insertion in model container [2021-03-26 00:22:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:22:56" (3/3) ... [2021-03-26 00:22:56,903 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc.i [2021-03-26 00:22:56,912 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:22:56,915 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:22:56,915 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:22:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,989 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,992 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:56,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:57,000 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:22:57,012 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:22:57,034 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:22:57,034 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:22:57,034 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:22:57,034 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:22:57,034 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:22:57,034 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:22:57,034 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:22:57,034 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:22:57,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:22:57,079 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:22:57,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:57,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:22:57,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:22:57,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-26 00:22:57,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:57,105 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:22:57,107 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:22:57,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-26 00:22:57,134 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:22:57,134 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:57,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:22:57,138 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-26 00:22:58,363 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:22:58,734 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:22:58,856 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:23:00,026 INFO L154 LiptonReduction]: Checked pairs total: 5432 [2021-03-26 00:23:00,026 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 00:23:00,028 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2934 [2021-03-26 00:23:00,034 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 00:23:00,034 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:00,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:00,034 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:00,034 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash 362100227, now seen corresponding path program 1 times [2021-03-26 00:23:00,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:00,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662407736] [2021-03-26 00:23:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:00,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:00,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:00,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:00,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:00,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662407736] [2021-03-26 00:23:00,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:00,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:00,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731983946] [2021-03-26 00:23:00,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:23:00,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:23:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:23:00,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 191 [2021-03-26 00:23:00,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:00,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:00,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 191 [2021-03-26 00:23:00,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:00,350 INFO L129 PetriNetUnfolder]: 133/367 cut-off events. [2021-03-26 00:23:00,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:00,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 367 events. 133/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2068 event pairs, 110 based on Foata normal form. 32/372 useless extension candidates. Maximal degree in co-relation 566. Up to 153 conditions per place. [2021-03-26 00:23:00,355 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 11 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2021-03-26 00:23:00,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 132 flow [2021-03-26 00:23:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:23:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:23:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 00:23:00,368 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9075043630017452 [2021-03-26 00:23:00,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 00:23:00,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 00:23:00,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:00,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 00:23:00,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:00,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:00,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:00,388 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 520 transitions. [2021-03-26 00:23:00,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 132 flow [2021-03-26 00:23:00,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:00,394 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-26 00:23:00,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 00:23:00,396 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:23:00,396 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:00,396 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:23:00,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:23:00,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-26 00:23:00,401 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 00:23:00,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:00,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:23:00,402 INFO L142 LiptonReduction]: Number of co-enabled transitions 576 [2021-03-26 00:23:01,628 INFO L154 LiptonReduction]: Checked pairs total: 3112 [2021-03-26 00:23:01,629 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:23:01,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1233 [2021-03-26 00:23:01,630 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-26 00:23:01,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:01,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:01,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:01,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:23:01,630 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2019036783, now seen corresponding path program 1 times [2021-03-26 00:23:01,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:01,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132353268] [2021-03-26 00:23:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:01,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:01,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:01,724 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:01,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:01,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:01,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:01,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132353268] [2021-03-26 00:23:01,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:01,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:01,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553247080] [2021-03-26 00:23:01,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:01,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:01,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 203 [2021-03-26 00:23:01,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:01,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:01,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 203 [2021-03-26 00:23:01,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:01,870 INFO L129 PetriNetUnfolder]: 303/710 cut-off events. [2021-03-26 00:23:01,871 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:01,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 710 events. 303/710 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4587 event pairs, 54 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 1196. Up to 190 conditions per place. [2021-03-26 00:23:01,873 INFO L132 encePairwiseOnDemand]: 194/203 looper letters, 8 selfloop transitions, 7 changer transitions 14/49 dead transitions. [2021-03-26 00:23:01,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 168 flow [2021-03-26 00:23:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2021-03-26 00:23:01,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.812807881773399 [2021-03-26 00:23:01,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2021-03-26 00:23:01,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2021-03-26 00:23:01,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:01,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2021-03-26 00:23:01,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:01,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:01,880 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:01,880 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 825 transitions. [2021-03-26 00:23:01,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 168 flow [2021-03-26 00:23:01,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:01,881 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 132 flow [2021-03-26 00:23:01,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 00:23:01,882 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2021-03-26 00:23:01,882 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:01,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 132 flow [2021-03-26 00:23:01,883 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 132 flow [2021-03-26 00:23:01,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 132 flow [2021-03-26 00:23:01,926 INFO L129 PetriNetUnfolder]: 158/449 cut-off events. [2021-03-26 00:23:01,926 INFO L130 PetriNetUnfolder]: For 144/199 co-relation queries the response was YES. [2021-03-26 00:23:01,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 449 events. 158/449 cut-off events. For 144/199 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2830 event pairs, 54 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 958. Up to 189 conditions per place. [2021-03-26 00:23:01,931 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 00:23:02,391 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:23:02,521 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:23:02,823 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:23:02,950 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:23:03,042 INFO L154 LiptonReduction]: Checked pairs total: 612 [2021-03-26 00:23:03,042 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:03,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1160 [2021-03-26 00:23:03,043 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 130 flow [2021-03-26 00:23:03,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:03,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:03,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:23:03,044 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -845603166, now seen corresponding path program 1 times [2021-03-26 00:23:03,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:03,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731706972] [2021-03-26 00:23:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:03,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:03,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:03,088 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:03,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:03,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731706972] [2021-03-26 00:23:03,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:03,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:03,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479521152] [2021-03-26 00:23:03,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:03,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:03,097 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 204 [2021-03-26 00:23:03,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:03,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 204 [2021-03-26 00:23:03,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:03,172 INFO L129 PetriNetUnfolder]: 133/399 cut-off events. [2021-03-26 00:23:03,172 INFO L130 PetriNetUnfolder]: For 176/724 co-relation queries the response was YES. [2021-03-26 00:23:03,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 399 events. 133/399 cut-off events. For 176/724 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2513 event pairs, 24 based on Foata normal form. 7/385 useless extension candidates. Maximal degree in co-relation 1073. Up to 163 conditions per place. [2021-03-26 00:23:03,174 INFO L132 encePairwiseOnDemand]: 196/204 looper letters, 13 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2021-03-26 00:23:03,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 238 flow [2021-03-26 00:23:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 672 transitions. [2021-03-26 00:23:03,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2021-03-26 00:23:03,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 672 transitions. [2021-03-26 00:23:03,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 672 transitions. [2021-03-26 00:23:03,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:03,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 672 transitions. [2021-03-26 00:23:03,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,179 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 130 flow. Second operand 4 states and 672 transitions. [2021-03-26 00:23:03,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 238 flow [2021-03-26 00:23:03,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 192 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:03,183 INFO L241 Difference]: Finished difference. Result has 45 places, 41 transitions, 188 flow [2021-03-26 00:23:03,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2021-03-26 00:23:03,183 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2021-03-26 00:23:03,183 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:03,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 188 flow [2021-03-26 00:23:03,184 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 188 flow [2021-03-26 00:23:03,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 188 flow [2021-03-26 00:23:03,210 INFO L129 PetriNetUnfolder]: 133/379 cut-off events. [2021-03-26 00:23:03,211 INFO L130 PetriNetUnfolder]: For 208/340 co-relation queries the response was YES. [2021-03-26 00:23:03,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 379 events. 133/379 cut-off events. For 208/340 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2328 event pairs, 22 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 874. Up to 163 conditions per place. [2021-03-26 00:23:03,214 INFO L142 LiptonReduction]: Number of co-enabled transitions 660 [2021-03-26 00:23:03,475 INFO L154 LiptonReduction]: Checked pairs total: 492 [2021-03-26 00:23:03,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:03,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 292 [2021-03-26 00:23:03,476 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 188 flow [2021-03-26 00:23:03,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:03,477 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:03,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:23:03,477 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 965176233, now seen corresponding path program 1 times [2021-03-26 00:23:03,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:03,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889796799] [2021-03-26 00:23:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:03,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:03,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889796799] [2021-03-26 00:23:03,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:03,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:23:03,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396337187] [2021-03-26 00:23:03,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:23:03,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:23:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:23:03,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 204 [2021-03-26 00:23:03,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:03,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 204 [2021-03-26 00:23:03,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:03,551 INFO L129 PetriNetUnfolder]: 117/349 cut-off events. [2021-03-26 00:23:03,551 INFO L130 PetriNetUnfolder]: For 321/538 co-relation queries the response was YES. [2021-03-26 00:23:03,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 349 events. 117/349 cut-off events. For 321/538 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2086 event pairs, 30 based on Foata normal form. 3/332 useless extension candidates. Maximal degree in co-relation 871. Up to 143 conditions per place. [2021-03-26 00:23:03,553 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 7 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2021-03-26 00:23:03,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 242 flow [2021-03-26 00:23:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:23:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:23:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-26 00:23:03,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 00:23:03,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-26 00:23:03,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-26 00:23:03,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:03,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-26 00:23:03,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,558 INFO L185 Difference]: Start difference. First operand has 45 places, 41 transitions, 188 flow. Second operand 3 states and 544 transitions. [2021-03-26 00:23:03,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 242 flow [2021-03-26 00:23:03,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:03,560 INFO L241 Difference]: Finished difference. Result has 48 places, 46 transitions, 246 flow [2021-03-26 00:23:03,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2021-03-26 00:23:03,560 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 00:23:03,561 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:03,561 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 246 flow [2021-03-26 00:23:03,561 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 246 flow [2021-03-26 00:23:03,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 246 flow [2021-03-26 00:23:03,588 INFO L129 PetriNetUnfolder]: 117/343 cut-off events. [2021-03-26 00:23:03,589 INFO L130 PetriNetUnfolder]: For 263/440 co-relation queries the response was YES. [2021-03-26 00:23:03,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 343 events. 117/343 cut-off events. For 263/440 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2069 event pairs, 19 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 873. Up to 143 conditions per place. [2021-03-26 00:23:03,592 INFO L142 LiptonReduction]: Number of co-enabled transitions 742 [2021-03-26 00:23:03,603 INFO L154 LiptonReduction]: Checked pairs total: 713 [2021-03-26 00:23:03,603 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:03,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 00:23:03,606 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 246 flow [2021-03-26 00:23:03,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:03,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:03,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:23:03,606 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:03,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1303593898, now seen corresponding path program 1 times [2021-03-26 00:23:03,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:03,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118619272] [2021-03-26 00:23:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:03,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:03,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:03,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:03,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:03,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118619272] [2021-03-26 00:23:03,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:03,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:03,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693947823] [2021-03-26 00:23:03,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:03,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:03,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:03,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:03,665 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 204 [2021-03-26 00:23:03,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:03,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 204 [2021-03-26 00:23:03,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:03,807 INFO L129 PetriNetUnfolder]: 897/1754 cut-off events. [2021-03-26 00:23:03,807 INFO L130 PetriNetUnfolder]: For 511/649 co-relation queries the response was YES. [2021-03-26 00:23:03,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 1754 events. 897/1754 cut-off events. For 511/649 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 13565 event pairs, 380 based on Foata normal form. 115/1549 useless extension candidates. Maximal degree in co-relation 3891. Up to 1139 conditions per place. [2021-03-26 00:23:03,819 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 12 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2021-03-26 00:23:03,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 318 flow [2021-03-26 00:23:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2021-03-26 00:23:03,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8470588235294118 [2021-03-26 00:23:03,820 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2021-03-26 00:23:03,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2021-03-26 00:23:03,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:03,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2021-03-26 00:23:03,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,824 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:03,824 INFO L185 Difference]: Start difference. First operand has 48 places, 46 transitions, 246 flow. Second operand 5 states and 864 transitions. [2021-03-26 00:23:03,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 318 flow [2021-03-26 00:23:03,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:23:03,828 INFO L241 Difference]: Finished difference. Result has 54 places, 55 transitions, 315 flow [2021-03-26 00:23:03,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2021-03-26 00:23:03,828 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-26 00:23:03,828 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:03,828 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 315 flow [2021-03-26 00:23:03,828 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 315 flow [2021-03-26 00:23:03,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 315 flow [2021-03-26 00:23:03,936 INFO L129 PetriNetUnfolder]: 666/1373 cut-off events. [2021-03-26 00:23:03,936 INFO L130 PetriNetUnfolder]: For 1212/1716 co-relation queries the response was YES. [2021-03-26 00:23:03,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1373 events. 666/1373 cut-off events. For 1212/1716 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 10575 event pairs, 264 based on Foata normal form. 9/1230 useless extension candidates. Maximal degree in co-relation 4006. Up to 791 conditions per place. [2021-03-26 00:23:03,951 INFO L142 LiptonReduction]: Number of co-enabled transitions 1072 [2021-03-26 00:23:04,274 INFO L154 LiptonReduction]: Checked pairs total: 1880 [2021-03-26 00:23:04,274 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:04,275 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 447 [2021-03-26 00:23:04,275 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 309 flow [2021-03-26 00:23:04,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:04,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:04,276 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:04,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:23:04,276 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1732912616, now seen corresponding path program 1 times [2021-03-26 00:23:04,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:04,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466473773] [2021-03-26 00:23:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:04,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:04,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:04,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:04,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:04,332 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:04,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:04,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466473773] [2021-03-26 00:23:04,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:04,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:04,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117495288] [2021-03-26 00:23:04,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:04,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:04,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 204 [2021-03-26 00:23:04,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:04,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:04,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 204 [2021-03-26 00:23:04,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:04,491 INFO L129 PetriNetUnfolder]: 836/1676 cut-off events. [2021-03-26 00:23:04,491 INFO L130 PetriNetUnfolder]: For 1789/3009 co-relation queries the response was YES. [2021-03-26 00:23:04,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 1676 events. 836/1676 cut-off events. For 1789/3009 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 12734 event pairs, 395 based on Foata normal form. 68/1572 useless extension candidates. Maximal degree in co-relation 5098. Up to 1082 conditions per place. [2021-03-26 00:23:04,504 INFO L132 encePairwiseOnDemand]: 196/204 looper letters, 19 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2021-03-26 00:23:04,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 435 flow [2021-03-26 00:23:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2021-03-26 00:23:04,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8223039215686274 [2021-03-26 00:23:04,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 671 transitions. [2021-03-26 00:23:04,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 671 transitions. [2021-03-26 00:23:04,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:04,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 671 transitions. [2021-03-26 00:23:04,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:04,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:04,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:04,509 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 309 flow. Second operand 4 states and 671 transitions. [2021-03-26 00:23:04,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 435 flow [2021-03-26 00:23:04,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 428 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:04,516 INFO L241 Difference]: Finished difference. Result has 56 places, 57 transitions, 420 flow [2021-03-26 00:23:04,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2021-03-26 00:23:04,517 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-26 00:23:04,517 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:04,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 420 flow [2021-03-26 00:23:04,517 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 57 transitions, 420 flow [2021-03-26 00:23:04,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 420 flow [2021-03-26 00:23:04,631 INFO L129 PetriNetUnfolder]: 805/1618 cut-off events. [2021-03-26 00:23:04,631 INFO L130 PetriNetUnfolder]: For 2000/2524 co-relation queries the response was YES. [2021-03-26 00:23:04,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 1618 events. 805/1618 cut-off events. For 2000/2524 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 12505 event pairs, 361 based on Foata normal form. 3/1472 useless extension candidates. Maximal degree in co-relation 4796. Up to 1013 conditions per place. [2021-03-26 00:23:04,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 1012 [2021-03-26 00:23:05,061 INFO L154 LiptonReduction]: Checked pairs total: 908 [2021-03-26 00:23:05,061 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:05,061 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 544 [2021-03-26 00:23:05,062 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 420 flow [2021-03-26 00:23:05,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:05,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:05,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:23:05,063 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1600342979, now seen corresponding path program 1 times [2021-03-26 00:23:05,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:05,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967043184] [2021-03-26 00:23:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:05,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:05,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967043184] [2021-03-26 00:23:05,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:05,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:05,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613622322] [2021-03-26 00:23:05,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:05,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:05,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 204 [2021-03-26 00:23:05,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:05,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 204 [2021-03-26 00:23:05,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:05,276 INFO L129 PetriNetUnfolder]: 897/1816 cut-off events. [2021-03-26 00:23:05,276 INFO L130 PetriNetUnfolder]: For 2080/3494 co-relation queries the response was YES. [2021-03-26 00:23:05,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 1816 events. 897/1816 cut-off events. For 2080/3494 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 14060 event pairs, 120 based on Foata normal form. 280/1911 useless extension candidates. Maximal degree in co-relation 6424. Up to 1241 conditions per place. [2021-03-26 00:23:05,290 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2021-03-26 00:23:05,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 554 flow [2021-03-26 00:23:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:23:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:23:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1037 transitions. [2021-03-26 00:23:05,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2021-03-26 00:23:05,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1037 transitions. [2021-03-26 00:23:05,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1037 transitions. [2021-03-26 00:23:05,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:05,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1037 transitions. [2021-03-26 00:23:05,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,296 INFO L185 Difference]: Start difference. First operand has 56 places, 57 transitions, 420 flow. Second operand 6 states and 1037 transitions. [2021-03-26 00:23:05,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 554 flow [2021-03-26 00:23:05,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 546 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:05,300 INFO L241 Difference]: Finished difference. Result has 64 places, 66 transitions, 532 flow [2021-03-26 00:23:05,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2021-03-26 00:23:05,300 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 00:23:05,301 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:05,301 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 532 flow [2021-03-26 00:23:05,301 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 532 flow [2021-03-26 00:23:05,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 532 flow [2021-03-26 00:23:05,384 INFO L129 PetriNetUnfolder]: 592/1324 cut-off events. [2021-03-26 00:23:05,384 INFO L130 PetriNetUnfolder]: For 3826/4661 co-relation queries the response was YES. [2021-03-26 00:23:05,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 1324 events. 592/1324 cut-off events. For 3826/4661 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 10382 event pairs, 97 based on Foata normal form. 36/1280 useless extension candidates. Maximal degree in co-relation 5710. Up to 916 conditions per place. [2021-03-26 00:23:05,400 INFO L142 LiptonReduction]: Number of co-enabled transitions 1382 [2021-03-26 00:23:05,751 INFO L154 LiptonReduction]: Checked pairs total: 2272 [2021-03-26 00:23:05,751 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:05,751 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 450 [2021-03-26 00:23:05,752 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 524 flow [2021-03-26 00:23:05,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:05,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:05,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:23:05,752 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 301320263, now seen corresponding path program 1 times [2021-03-26 00:23:05,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:05,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596051126] [2021-03-26 00:23:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:05,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,800 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:23:05,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:23:05,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:05,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:05,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:05,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596051126] [2021-03-26 00:23:05,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:05,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:23:05,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443082738] [2021-03-26 00:23:05,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:23:05,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:23:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:23:05,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 204 [2021-03-26 00:23:05,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:05,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:05,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 204 [2021-03-26 00:23:05,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:05,994 INFO L129 PetriNetUnfolder]: 616/1259 cut-off events. [2021-03-26 00:23:05,994 INFO L130 PetriNetUnfolder]: For 3461/5303 co-relation queries the response was YES. [2021-03-26 00:23:06,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 1259 events. 616/1259 cut-off events. For 3461/5303 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 8824 event pairs, 24 based on Foata normal form. 291/1406 useless extension candidates. Maximal degree in co-relation 5859. Up to 840 conditions per place. [2021-03-26 00:23:06,005 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 18 changer transitions 4/77 dead transitions. [2021-03-26 00:23:06,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 680 flow [2021-03-26 00:23:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:23:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:23:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1210 transitions. [2021-03-26 00:23:06,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8473389355742297 [2021-03-26 00:23:06,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1210 transitions. [2021-03-26 00:23:06,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1210 transitions. [2021-03-26 00:23:06,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:06,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1210 transitions. [2021-03-26 00:23:06,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,013 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,013 INFO L185 Difference]: Start difference. First operand has 64 places, 65 transitions, 524 flow. Second operand 7 states and 1210 transitions. [2021-03-26 00:23:06,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 680 flow [2021-03-26 00:23:06,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 618 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:06,032 INFO L241 Difference]: Finished difference. Result has 67 places, 70 transitions, 584 flow [2021-03-26 00:23:06,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2021-03-26 00:23:06,032 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 00:23:06,032 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:06,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 70 transitions, 584 flow [2021-03-26 00:23:06,033 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 70 transitions, 584 flow [2021-03-26 00:23:06,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 70 transitions, 584 flow [2021-03-26 00:23:06,092 INFO L129 PetriNetUnfolder]: 303/767 cut-off events. [2021-03-26 00:23:06,092 INFO L130 PetriNetUnfolder]: For 2044/2301 co-relation queries the response was YES. [2021-03-26 00:23:06,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 767 events. 303/767 cut-off events. For 2044/2301 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5466 event pairs, 15 based on Foata normal form. 1/728 useless extension candidates. Maximal degree in co-relation 3275. Up to 460 conditions per place. [2021-03-26 00:23:06,102 INFO L142 LiptonReduction]: Number of co-enabled transitions 1320 [2021-03-26 00:23:06,217 INFO L154 LiptonReduction]: Checked pairs total: 2648 [2021-03-26 00:23:06,217 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:06,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-03-26 00:23:06,217 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 574 flow [2021-03-26 00:23:06,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:06,218 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] [2021-03-26 00:23:06,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:23:06,218 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1164663514, now seen corresponding path program 1 times [2021-03-26 00:23:06,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:06,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854861787] [2021-03-26 00:23:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:06,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:06,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:06,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:06,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:06,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:06,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:06,318 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:23:06,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:23:06,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:06,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:06,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:06,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:06,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854861787] [2021-03-26 00:23:06,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:06,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:23:06,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735161048] [2021-03-26 00:23:06,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:23:06,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:23:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:23:06,329 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 204 [2021-03-26 00:23:06,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 574 flow. Second operand has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:06,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 204 [2021-03-26 00:23:06,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:06,466 INFO L129 PetriNetUnfolder]: 523/1022 cut-off events. [2021-03-26 00:23:06,466 INFO L130 PetriNetUnfolder]: For 2808/4079 co-relation queries the response was YES. [2021-03-26 00:23:06,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 1022 events. 523/1022 cut-off events. For 2808/4079 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 6606 event pairs, 14 based on Foata normal form. 153/1038 useless extension candidates. Maximal degree in co-relation 4398. Up to 536 conditions per place. [2021-03-26 00:23:06,473 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 14/74 dead transitions. [2021-03-26 00:23:06,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 640 flow [2021-03-26 00:23:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:23:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:23:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1375 transitions. [2021-03-26 00:23:06,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8425245098039216 [2021-03-26 00:23:06,476 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1375 transitions. [2021-03-26 00:23:06,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1375 transitions. [2021-03-26 00:23:06,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:06,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1375 transitions. [2021-03-26 00:23:06,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 171.875) internal successors, (1375), 8 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,480 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:06,480 INFO L185 Difference]: Start difference. First operand has 67 places, 69 transitions, 574 flow. Second operand 8 states and 1375 transitions. [2021-03-26 00:23:06,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 640 flow [2021-03-26 00:23:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 595 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:06,497 INFO L241 Difference]: Finished difference. Result has 71 places, 57 transitions, 451 flow [2021-03-26 00:23:06,497 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=451, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2021-03-26 00:23:06,497 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-26 00:23:06,497 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:06,497 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 57 transitions, 451 flow [2021-03-26 00:23:06,497 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 57 transitions, 451 flow [2021-03-26 00:23:06,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 57 transitions, 451 flow [2021-03-26 00:23:06,518 INFO L129 PetriNetUnfolder]: 114/311 cut-off events. [2021-03-26 00:23:06,518 INFO L130 PetriNetUnfolder]: For 681/761 co-relation queries the response was YES. [2021-03-26 00:23:06,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 311 events. 114/311 cut-off events. For 681/761 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1755 event pairs, 6 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1207. Up to 105 conditions per place. [2021-03-26 00:23:06,521 INFO L142 LiptonReduction]: Number of co-enabled transitions 792 [2021-03-26 00:23:06,784 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:06,897 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:07,192 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:23:07,321 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:23:07,332 INFO L154 LiptonReduction]: Checked pairs total: 2344 [2021-03-26 00:23:07,332 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:23:07,332 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 835 [2021-03-26 00:23:07,333 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 435 flow [2021-03-26 00:23:07,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,333 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:07,333 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:07,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:23:07,333 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1969630507, now seen corresponding path program 1 times [2021-03-26 00:23:07,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:07,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998138502] [2021-03-26 00:23:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:07,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:07,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:07,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:07,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:07,370 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:07,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:07,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998138502] [2021-03-26 00:23:07,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:07,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:07,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045902742] [2021-03-26 00:23:07,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:07,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:07,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 206 [2021-03-26 00:23:07,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:07,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 206 [2021-03-26 00:23:07,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:07,455 INFO L129 PetriNetUnfolder]: 187/468 cut-off events. [2021-03-26 00:23:07,456 INFO L130 PetriNetUnfolder]: For 2407/2529 co-relation queries the response was YES. [2021-03-26 00:23:07,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 468 events. 187/468 cut-off events. For 2407/2529 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2880 event pairs, 1 based on Foata normal form. 31/482 useless extension candidates. Maximal degree in co-relation 1868. Up to 138 conditions per place. [2021-03-26 00:23:07,459 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 15 selfloop transitions, 30 changer transitions 1/75 dead transitions. [2021-03-26 00:23:07,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 723 flow [2021-03-26 00:23:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2021-03-26 00:23:07,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8019417475728156 [2021-03-26 00:23:07,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2021-03-26 00:23:07,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2021-03-26 00:23:07,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:07,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2021-03-26 00:23:07,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,464 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,464 INFO L185 Difference]: Start difference. First operand has 67 places, 54 transitions, 435 flow. Second operand 5 states and 826 transitions. [2021-03-26 00:23:07,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 723 flow [2021-03-26 00:23:07,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 619 flow, removed 19 selfloop flow, removed 10 redundant places. [2021-03-26 00:23:07,471 INFO L241 Difference]: Finished difference. Result has 64 places, 71 transitions, 626 flow [2021-03-26 00:23:07,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=626, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2021-03-26 00:23:07,471 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 00:23:07,472 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:07,472 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 71 transitions, 626 flow [2021-03-26 00:23:07,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 71 transitions, 626 flow [2021-03-26 00:23:07,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 71 transitions, 626 flow [2021-03-26 00:23:07,499 INFO L129 PetriNetUnfolder]: 177/435 cut-off events. [2021-03-26 00:23:07,499 INFO L130 PetriNetUnfolder]: For 1232/1293 co-relation queries the response was YES. [2021-03-26 00:23:07,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 435 events. 177/435 cut-off events. For 1232/1293 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2650 event pairs, 6 based on Foata normal form. 17/425 useless extension candidates. Maximal degree in co-relation 1501. Up to 114 conditions per place. [2021-03-26 00:23:07,504 INFO L142 LiptonReduction]: Number of co-enabled transitions 990 [2021-03-26 00:23:07,717 INFO L154 LiptonReduction]: Checked pairs total: 1165 [2021-03-26 00:23:07,717 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:07,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 245 [2021-03-26 00:23:07,718 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 626 flow [2021-03-26 00:23:07,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:07,718 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 00:23:07,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:23:07,718 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 756810837, now seen corresponding path program 1 times [2021-03-26 00:23:07,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:07,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422062874] [2021-03-26 00:23:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:07,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:07,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:07,799 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-03-26 00:23:07,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:23:07,810 INFO L142 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size [2021-03-26 00:23:07,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:23:07,836 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-26 00:23:07,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:23:07,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:07,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:07,853 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:07,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:07,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422062874] [2021-03-26 00:23:07,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:07,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:23:07,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955390887] [2021-03-26 00:23:07,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:23:07,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:23:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:23:07,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 206 [2021-03-26 00:23:07,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 626 flow. Second operand has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:07,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:07,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 206 [2021-03-26 00:23:07,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:08,268 INFO L129 PetriNetUnfolder]: 1232/2478 cut-off events. [2021-03-26 00:23:08,268 INFO L130 PetriNetUnfolder]: For 10603/10960 co-relation queries the response was YES. [2021-03-26 00:23:08,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 2478 events. 1232/2478 cut-off events. For 10603/10960 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 18578 event pairs, 61 based on Foata normal form. 135/2518 useless extension candidates. Maximal degree in co-relation 8760. Up to 567 conditions per place. [2021-03-26 00:23:08,285 INFO L132 encePairwiseOnDemand]: 194/206 looper letters, 43 selfloop transitions, 77 changer transitions 6/152 dead transitions. [2021-03-26 00:23:08,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 152 transitions, 1654 flow [2021-03-26 00:23:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:23:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:23:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1114 transitions. [2021-03-26 00:23:08,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6759708737864077 [2021-03-26 00:23:08,288 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1114 transitions. [2021-03-26 00:23:08,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1114 transitions. [2021-03-26 00:23:08,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:08,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1114 transitions. [2021-03-26 00:23:08,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:08,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:08,292 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:08,292 INFO L185 Difference]: Start difference. First operand has 64 places, 71 transitions, 626 flow. Second operand 8 states and 1114 transitions. [2021-03-26 00:23:08,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 152 transitions, 1654 flow [2021-03-26 00:23:08,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 152 transitions, 1654 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:08,352 INFO L241 Difference]: Finished difference. Result has 75 places, 121 transitions, 1507 flow [2021-03-26 00:23:08,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1507, PETRI_PLACES=75, PETRI_TRANSITIONS=121} [2021-03-26 00:23:08,352 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2021-03-26 00:23:08,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:08,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 121 transitions, 1507 flow [2021-03-26 00:23:08,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 121 transitions, 1507 flow [2021-03-26 00:23:08,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 121 transitions, 1507 flow [2021-03-26 00:23:08,403 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L779-->L782: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][99], [513#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork2InUse, Black: 515#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 509#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 511#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 11#L866-1true, 268#(<= ~__unbuffered_cnt~0 0), 466#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z~0 1)), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 464#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 463#(= ~z~0 1), Black: 144#true, Black: 343#(not (= 4 ~__unbuffered_cnt~0)), 160#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 34#L769true, Black: 157#true, 35#L819true, Black: 414#(not (= 4 ~__unbuffered_cnt~0)), Black: 159#(= ~y~0 0), 106#L802true, 52#L782true, P0Thread1of1ForFork0InUse, 252#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork1InUse, Black: 251#(= ~x~0 1), P3Thread1of1ForFork3InUse]) [2021-03-26 00:23:08,404 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 00:23:08,404 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 00:23:08,404 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 00:23:08,404 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 00:23:08,407 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L819-->L835: Formula: (let ((.cse30 (= (mod v_~a$w_buff1_used~0_366 256) 0)) (.cse6 (= 0 (mod v_~a$r_buff1_thd4~0_181 256))) (.cse25 (= (mod v_~a$r_buff0_thd4~0_234 256) 0))) (let ((.cse14 (not .cse25)) (.cse9 (not .cse6)) (.cse3 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_88 256) 0)) (.cse24 (and .cse25 .cse6)) (.cse28 (and .cse30 .cse25)) (.cse31 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse5 (= (mod v_~a$w_buff1_used~0_365 256) 0))) (let ((.cse11 (not .cse5)) (.cse17 (or .cse31 .cse25)) (.cse16 (not .cse31)) (.cse12 (or .cse31 .cse24 .cse28)) (.cse1 (not .cse2)) (.cse26 (or .cse3 .cse25)) (.cse7 (not .cse3)) (.cse18 (or .cse14 .cse9)) (.cse19 (or .cse14 (not .cse30)))) (and (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_88) (let ((.cse0 (= |v_P3_#t~ite42_55| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse0 .cse1 (= v_~a$r_buff1_thd4~0_181 v_~a$r_buff1_thd4~0_180) (= |v_P3_#t~ite43_45| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_180) .cse2 (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_233 256) 0))) (or (and (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6)) .cse0 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_181)) (let ((.cse8 (not .cse4))) (and .cse7 (or .cse8 .cse9) (let ((.cse10 (= |v_P3_#t~ite42_55| 0))) (or (and .cse10 (or .cse3 .cse4)) (and .cse8 .cse7 .cse10))) (or .cse8 .cse11) (= |v_P3_#t~ite42_55| |v_P3_#t~ite43_45|)))))))) (= v_~a$flush_delayed~0_42 0) (let ((.cse13 (= |v_P3_#t~ite27_65| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and (= |v_P3_#t~ite28_59| v_~a$w_buff0~0_119) .cse2 (or (and (= |v_P3_#t~ite28_59| v_~a$w_buff0~0_120) .cse12 .cse13) (and (let ((.cse15 (= |v_P3_#t~ite27_65| v_~a$w_buff0~0_120))) (or (and .cse14 .cse15 .cse16) (and .cse15 .cse17))) .cse16 .cse18 (= |v_P3_#t~ite27_65| |v_P3_#t~ite28_59|) .cse19))) (and (= v_~a$w_buff0~0_119 v_~a$w_buff0~0_120) .cse1 (= |v_P3_#t~ite28_59| |v_P3Thread1of1ForFork3_#t~ite28_1|) .cse13))) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_15) (let ((.cse20 (= |v_P3_#t~ite30_47| |v_P3Thread1of1ForFork3_#t~ite30_1|))) (or (and (= v_~a$w_buff1~0_119 v_~a$w_buff1~0_118) .cse1 .cse20 (= |v_P3_#t~ite31_43| |v_P3Thread1of1ForFork3_#t~ite31_1|)) (and (= |v_P3_#t~ite31_43| v_~a$w_buff1~0_118) (or (and .cse12 .cse20 (= |v_P3_#t~ite31_43| v_~a$w_buff1~0_119)) (and (let ((.cse21 (= |v_P3_#t~ite30_47| v_~a$w_buff1~0_119))) (or (and .cse14 .cse16 .cse21) (and .cse17 .cse21))) .cse16 .cse18 (= |v_P3_#t~ite30_47| |v_P3_#t~ite31_43|) .cse19)) .cse2))) (let ((.cse22 (= |v_P3Thread1of1ForFork3_#t~ite33_1| |v_P3_#t~ite33_47|))) (or (and .cse2 (or (and (= |v_P3_#t~ite33_47| |v_P3_#t~ite34_35|) (or (and .cse17 (= |v_P3_#t~ite33_47| v_~a$w_buff0_used~0_484)) (and .cse14 (= |v_P3_#t~ite33_47| 0) .cse16)) .cse16 .cse18 .cse19) (and .cse12 (= |v_P3_#t~ite34_35| v_~a$w_buff0_used~0_484) .cse22)) (= |v_P3_#t~ite34_35| v_~a$w_buff0_used~0_483)) (and .cse1 (= |v_P3Thread1of1ForFork3_#t~ite34_1| |v_P3_#t~ite34_35|) .cse22 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)))) (let ((.cse23 (= |v_P3_#t~ite39_49| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse2 (or (and .cse23 (or .cse3 .cse24 (and .cse5 .cse25)) (= |v_P3_#t~ite40_37| v_~a$r_buff0_thd4~0_234)) (and (= |v_P3_#t~ite39_49| |v_P3_#t~ite40_37|) .cse7 (or (and (= |v_P3_#t~ite39_49| v_~a$r_buff0_thd4~0_234) .cse26) (and .cse14 .cse7 (= |v_P3_#t~ite39_49| 0))) (or .cse14 .cse11) .cse18)) (= |v_P3_#t~ite40_37| v_~a$r_buff0_thd4~0_233)) (and (= v_~a$r_buff0_thd4~0_234 v_~a$r_buff0_thd4~0_233) .cse23 .cse1 (= |v_P3_#t~ite40_37| |v_P3Thread1of1ForFork3_#t~ite40_1|)))) (or (and (= v_~a~0_196 v_~__unbuffered_p3_EAX~0_14) .cse2) (and (= v_~a~0_196 v_~a$mem_tmp~0_30) .cse1)) (or (and (= |v_P3_#t~ite25_55| v_~__unbuffered_p3_EAX~0_14) .cse16 .cse18 (or (and (= |v_P3_#t~ite25_55| v_~a$w_buff1~0_119) .cse17) (and .cse14 (= |v_P3_#t~ite25_55| v_~a$w_buff0~0_120) .cse16)) .cse19) (and .cse12 (= v_~a~0_198 v_~__unbuffered_p3_EAX~0_14) (= |v_P3_#t~ite25_55| |v_P3Thread1of1ForFork3_#t~ite25_1|))) (let ((.cse27 (= |v_P3_#t~ite36_57| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse1 .cse27 (= v_~a$w_buff1_used~0_366 v_~a$w_buff1_used~0_365) (= |v_P3_#t~ite37_45| |v_P3Thread1of1ForFork3_#t~ite37_1|)) (and (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_365) .cse2 (or (and .cse27 (or .cse3 .cse24 .cse28) (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_366)) (and (let ((.cse29 (= |v_P3_#t~ite36_57| 0))) (or (and .cse14 .cse7 .cse29) (and .cse26 .cse29))) .cse7 .cse18 (= |v_P3_#t~ite36_57| |v_P3_#t~ite37_45|) .cse19))))) (= v_~a~0_198 v_~a$mem_tmp~0_30))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_181, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_234, ~a~0=v_~a~0_198, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_119, ~a$w_buff0~0=v_~a$w_buff0~0_120, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_180, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_233, ~a~0=v_~a~0_196, ~a$mem_tmp~0=v_~a$mem_tmp~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_118, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~weak$$choice0~0=v_~weak$$choice0~0_15, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_119, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_365, ~weak$$choice2~0=v_~weak$$choice2~0_88, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite34_35|, |v_P3_#t~ite28_59|, |v_P3_#t~ite25_55|, |v_P3_#t~ite31_43|, |v_P3_#t~ite33_47|, |v_P3_#t~ite27_65|, |v_P3_#t~ite30_47|, |v_P3_#t~ite36_57|, |v_P3_#t~ite42_55|, |v_P3_#t~ite43_45|, |v_P3_#t~ite39_49|, |v_P3_#t~ite37_45|, |v_P3_#t~ite40_37|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][78], [Black: 252#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 513#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork2InUse, Black: 515#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 509#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 511#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 11#L866-1true, 268#(<= ~__unbuffered_cnt~0 0), 463#(= ~z~0 1), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 464#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 466#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z~0 1)), Black: 146#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 343#(not (= 4 ~__unbuffered_cnt~0)), 157#true, Black: 160#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 34#L769true, Black: 414#(not (= 4 ~__unbuffered_cnt~0)), Black: 159#(= ~y~0 0), 106#L802true, 112#L835true, 249#true, 58#L779true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, Black: 251#(= ~x~0 1), P3Thread1of1ForFork3InUse]) [2021-03-26 00:23:08,407 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-26 00:23:08,407 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 00:23:08,407 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 00:23:08,407 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 00:23:08,456 INFO L129 PetriNetUnfolder]: 627/1330 cut-off events. [2021-03-26 00:23:08,456 INFO L130 PetriNetUnfolder]: For 6538/6858 co-relation queries the response was YES. [2021-03-26 00:23:08,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5169 conditions, 1330 events. 627/1330 cut-off events. For 6538/6858 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9585 event pairs, 17 based on Foata normal form. 60/1284 useless extension candidates. Maximal degree in co-relation 5136. Up to 371 conditions per place. [2021-03-26 00:23:08,471 INFO L142 LiptonReduction]: Number of co-enabled transitions 1608 [2021-03-26 00:23:08,889 INFO L154 LiptonReduction]: Checked pairs total: 649 [2021-03-26 00:23:08,889 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:08,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 537 [2021-03-26 00:23:08,890 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 121 transitions, 1507 flow [2021-03-26 00:23:08,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:08,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:08,890 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 00:23:08,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:23:08,891 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1542258463, now seen corresponding path program 2 times [2021-03-26 00:23:08,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:08,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147035936] [2021-03-26 00:23:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:08,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:08,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:08,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:08,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:08,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147035936] [2021-03-26 00:23:08,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:08,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:08,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748842685] [2021-03-26 00:23:08,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:23:08,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:23:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:23:08,966 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 206 [2021-03-26 00:23:08,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 121 transitions, 1507 flow. Second operand has 3 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 00:23:08,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:08,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 206 [2021-03-26 00:23:08,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:09,029 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L819-->L835: Formula: (let ((.cse30 (= (mod v_~a$w_buff1_used~0_366 256) 0)) (.cse6 (= 0 (mod v_~a$r_buff1_thd4~0_181 256))) (.cse25 (= (mod v_~a$r_buff0_thd4~0_234 256) 0))) (let ((.cse14 (not .cse25)) (.cse9 (not .cse6)) (.cse3 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_88 256) 0)) (.cse24 (and .cse25 .cse6)) (.cse28 (and .cse30 .cse25)) (.cse31 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse5 (= (mod v_~a$w_buff1_used~0_365 256) 0))) (let ((.cse11 (not .cse5)) (.cse17 (or .cse31 .cse25)) (.cse16 (not .cse31)) (.cse12 (or .cse31 .cse24 .cse28)) (.cse1 (not .cse2)) (.cse26 (or .cse3 .cse25)) (.cse7 (not .cse3)) (.cse18 (or .cse14 .cse9)) (.cse19 (or .cse14 (not .cse30)))) (and (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_88) (let ((.cse0 (= |v_P3_#t~ite42_55| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse0 .cse1 (= v_~a$r_buff1_thd4~0_181 v_~a$r_buff1_thd4~0_180) (= |v_P3_#t~ite43_45| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_180) .cse2 (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_233 256) 0))) (or (and (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6)) .cse0 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_181)) (let ((.cse8 (not .cse4))) (and .cse7 (or .cse8 .cse9) (let ((.cse10 (= |v_P3_#t~ite42_55| 0))) (or (and .cse10 (or .cse3 .cse4)) (and .cse8 .cse7 .cse10))) (or .cse8 .cse11) (= |v_P3_#t~ite42_55| |v_P3_#t~ite43_45|)))))))) (= v_~a$flush_delayed~0_42 0) (let ((.cse13 (= |v_P3_#t~ite27_65| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and (= |v_P3_#t~ite28_59| v_~a$w_buff0~0_119) .cse2 (or (and (= |v_P3_#t~ite28_59| v_~a$w_buff0~0_120) .cse12 .cse13) (and (let ((.cse15 (= |v_P3_#t~ite27_65| v_~a$w_buff0~0_120))) (or (and .cse14 .cse15 .cse16) (and .cse15 .cse17))) .cse16 .cse18 (= |v_P3_#t~ite27_65| |v_P3_#t~ite28_59|) .cse19))) (and (= v_~a$w_buff0~0_119 v_~a$w_buff0~0_120) .cse1 (= |v_P3_#t~ite28_59| |v_P3Thread1of1ForFork3_#t~ite28_1|) .cse13))) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_15) (let ((.cse20 (= |v_P3_#t~ite30_47| |v_P3Thread1of1ForFork3_#t~ite30_1|))) (or (and (= v_~a$w_buff1~0_119 v_~a$w_buff1~0_118) .cse1 .cse20 (= |v_P3_#t~ite31_43| |v_P3Thread1of1ForFork3_#t~ite31_1|)) (and (= |v_P3_#t~ite31_43| v_~a$w_buff1~0_118) (or (and .cse12 .cse20 (= |v_P3_#t~ite31_43| v_~a$w_buff1~0_119)) (and (let ((.cse21 (= |v_P3_#t~ite30_47| v_~a$w_buff1~0_119))) (or (and .cse14 .cse16 .cse21) (and .cse17 .cse21))) .cse16 .cse18 (= |v_P3_#t~ite30_47| |v_P3_#t~ite31_43|) .cse19)) .cse2))) (let ((.cse22 (= |v_P3Thread1of1ForFork3_#t~ite33_1| |v_P3_#t~ite33_47|))) (or (and .cse2 (or (and (= |v_P3_#t~ite33_47| |v_P3_#t~ite34_35|) (or (and .cse17 (= |v_P3_#t~ite33_47| v_~a$w_buff0_used~0_484)) (and .cse14 (= |v_P3_#t~ite33_47| 0) .cse16)) .cse16 .cse18 .cse19) (and .cse12 (= |v_P3_#t~ite34_35| v_~a$w_buff0_used~0_484) .cse22)) (= |v_P3_#t~ite34_35| v_~a$w_buff0_used~0_483)) (and .cse1 (= |v_P3Thread1of1ForFork3_#t~ite34_1| |v_P3_#t~ite34_35|) .cse22 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)))) (let ((.cse23 (= |v_P3_#t~ite39_49| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse2 (or (and .cse23 (or .cse3 .cse24 (and .cse5 .cse25)) (= |v_P3_#t~ite40_37| v_~a$r_buff0_thd4~0_234)) (and (= |v_P3_#t~ite39_49| |v_P3_#t~ite40_37|) .cse7 (or (and (= |v_P3_#t~ite39_49| v_~a$r_buff0_thd4~0_234) .cse26) (and .cse14 .cse7 (= |v_P3_#t~ite39_49| 0))) (or .cse14 .cse11) .cse18)) (= |v_P3_#t~ite40_37| v_~a$r_buff0_thd4~0_233)) (and (= v_~a$r_buff0_thd4~0_234 v_~a$r_buff0_thd4~0_233) .cse23 .cse1 (= |v_P3_#t~ite40_37| |v_P3Thread1of1ForFork3_#t~ite40_1|)))) (or (and (= v_~a~0_196 v_~__unbuffered_p3_EAX~0_14) .cse2) (and (= v_~a~0_196 v_~a$mem_tmp~0_30) .cse1)) (or (and (= |v_P3_#t~ite25_55| v_~__unbuffered_p3_EAX~0_14) .cse16 .cse18 (or (and (= |v_P3_#t~ite25_55| v_~a$w_buff1~0_119) .cse17) (and .cse14 (= |v_P3_#t~ite25_55| v_~a$w_buff0~0_120) .cse16)) .cse19) (and .cse12 (= v_~a~0_198 v_~__unbuffered_p3_EAX~0_14) (= |v_P3_#t~ite25_55| |v_P3Thread1of1ForFork3_#t~ite25_1|))) (let ((.cse27 (= |v_P3_#t~ite36_57| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse1 .cse27 (= v_~a$w_buff1_used~0_366 v_~a$w_buff1_used~0_365) (= |v_P3_#t~ite37_45| |v_P3Thread1of1ForFork3_#t~ite37_1|)) (and (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_365) .cse2 (or (and .cse27 (or .cse3 .cse24 .cse28) (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_366)) (and (let ((.cse29 (= |v_P3_#t~ite36_57| 0))) (or (and .cse14 .cse7 .cse29) (and .cse26 .cse29))) .cse7 .cse18 (= |v_P3_#t~ite36_57| |v_P3_#t~ite37_45|) .cse19))))) (= v_~a~0_198 v_~a$mem_tmp~0_30))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_181, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_234, ~a~0=v_~a~0_198, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_119, ~a$w_buff0~0=v_~a$w_buff0~0_120, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_180, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_233, ~a~0=v_~a~0_196, ~a$mem_tmp~0=v_~a$mem_tmp~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_118, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~weak$$choice0~0=v_~weak$$choice0~0_15, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_119, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_365, ~weak$$choice2~0=v_~weak$$choice2~0_88, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite34_35|, |v_P3_#t~ite28_59|, |v_P3_#t~ite25_55|, |v_P3_#t~ite31_43|, |v_P3_#t~ite33_47|, |v_P3_#t~ite27_65|, |v_P3_#t~ite30_47|, |v_P3_#t~ite36_57|, |v_P3_#t~ite42_55|, |v_P3_#t~ite43_45|, |v_P3_#t~ite39_49|, |v_P3_#t~ite37_45|, |v_P3_#t~ite40_37|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][55], [Black: 252#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), P2Thread1of1ForFork2InUse, 68#L809true, Black: 513#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 515#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 509#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 511#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 11#L866-1true, 268#(<= ~__unbuffered_cnt~0 0), 463#(= ~z~0 1), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 464#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 466#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z~0 1)), Black: 146#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 343#(not (= 4 ~__unbuffered_cnt~0)), 157#true, Black: 160#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 34#L769true, Black: 159#(= ~y~0 0), Black: 414#(not (= 4 ~__unbuffered_cnt~0)), 112#L835true, 502#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 249#true, 58#L779true, 571#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 251#(= ~x~0 1)]) [2021-03-26 00:23:09,029 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L779-->L782: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][94], [P2Thread1of1ForFork2InUse, 68#L809true, Black: 513#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 515#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 511#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 11#L866-1true, 268#(<= ~__unbuffered_cnt~0 0), 466#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~z~0 1)), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 464#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 463#(= ~z~0 1), Black: 144#true, Black: 343#(not (= 4 ~__unbuffered_cnt~0)), 160#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 34#L769true, Black: 157#true, 35#L819true, Black: 159#(= ~y~0 0), Black: 414#(not (= 4 ~__unbuffered_cnt~0)), 52#L782true, P0Thread1of1ForFork0InUse, 252#(or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork1InUse, 509#(and (or (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 573#(= ~y~0 1), P3Thread1of1ForFork3InUse, Black: 251#(= ~x~0 1)]) [2021-03-26 00:23:09,030 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,030 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:23:09,102 INFO L129 PetriNetUnfolder]: 837/1816 cut-off events. [2021-03-26 00:23:09,103 INFO L130 PetriNetUnfolder]: For 8361/8650 co-relation queries the response was YES. [2021-03-26 00:23:09,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6620 conditions, 1816 events. 837/1816 cut-off events. For 8361/8650 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 14118 event pairs, 37 based on Foata normal form. 65/1748 useless extension candidates. Maximal degree in co-relation 6585. Up to 543 conditions per place. [2021-03-26 00:23:09,114 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 13 selfloop transitions, 18 changer transitions 18/121 dead transitions. [2021-03-26 00:23:09,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 1581 flow [2021-03-26 00:23:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:23:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:23:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2021-03-26 00:23:09,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8737864077669902 [2021-03-26 00:23:09,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2021-03-26 00:23:09,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2021-03-26 00:23:09,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:09,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2021-03-26 00:23:09,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:09,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:09,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:09,117 INFO L185 Difference]: Start difference. First operand has 75 places, 121 transitions, 1507 flow. Second operand 3 states and 540 transitions. [2021-03-26 00:23:09,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 1581 flow [2021-03-26 00:23:09,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 1574 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:09,172 INFO L241 Difference]: Finished difference. Result has 76 places, 103 transitions, 1256 flow [2021-03-26 00:23:09,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=76, PETRI_TRANSITIONS=103} [2021-03-26 00:23:09,172 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-26 00:23:09,172 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:09,172 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 103 transitions, 1256 flow [2021-03-26 00:23:09,172 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 103 transitions, 1256 flow [2021-03-26 00:23:09,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 103 transitions, 1256 flow [2021-03-26 00:23:09,259 INFO L129 PetriNetUnfolder]: 583/1287 cut-off events. [2021-03-26 00:23:09,259 INFO L130 PetriNetUnfolder]: For 6390/6655 co-relation queries the response was YES. [2021-03-26 00:23:09,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 1287 events. 583/1287 cut-off events. For 6390/6655 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 9508 event pairs, 27 based on Foata normal form. 52/1236 useless extension candidates. Maximal degree in co-relation 4773. Up to 381 conditions per place. [2021-03-26 00:23:09,293 INFO L142 LiptonReduction]: Number of co-enabled transitions 1308 [2021-03-26 00:23:09,496 INFO L154 LiptonReduction]: Checked pairs total: 650 [2021-03-26 00:23:09,496 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:09,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 324 [2021-03-26 00:23:09,497 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 103 transitions, 1256 flow [2021-03-26 00:23:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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 00:23:09,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:09,497 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 00:23:09,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:23:09,498 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1869232867, now seen corresponding path program 3 times [2021-03-26 00:23:09,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:09,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719550442] [2021-03-26 00:23:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:09,523 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:09,569 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:09,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:23:09,589 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:23:09,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:23:09,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:23:09 BasicIcfg [2021-03-26 00:23:09,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:23:09,659 INFO L168 Benchmark]: Toolchain (without parser) took 14903.54 ms. Allocated memory was 341.8 MB in the beginning and 679.5 MB in the end (delta: 337.6 MB). Free memory was 305.7 MB in the beginning and 571.5 MB in the end (delta: -265.8 MB). Peak memory consumption was 74.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:09,659 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 341.8 MB. Free memory is still 323.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:23:09,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.10 ms. Allocated memory is still 341.8 MB. Free memory was 305.4 MB in the beginning and 299.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:09,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.09 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 297.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:09,659 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:09,660 INFO L168 Benchmark]: RCFGBuilder took 1646.09 ms. Allocated memory is still 341.8 MB. Free memory was 295.3 MB in the beginning and 218.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:09,660 INFO L168 Benchmark]: TraceAbstraction took 12758.49 ms. Allocated memory was 341.8 MB in the beginning and 679.5 MB in the end (delta: 337.6 MB). Free memory was 217.2 MB in the beginning and 571.5 MB in the end (delta: -354.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:23:09,666 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.37 ms. Allocated memory is still 341.8 MB. Free memory is still 323.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 425.10 ms. Allocated memory is still 341.8 MB. Free memory was 305.4 MB in the beginning and 299.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.09 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 297.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.39 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1646.09 ms. Allocated memory is still 341.8 MB. Free memory was 295.3 MB in the beginning and 218.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12758.49 ms. Allocated memory was 341.8 MB in the beginning and 679.5 MB in the end (delta: 337.6 MB). Free memory was 217.2 MB in the beginning and 571.5 MB in the end (delta: -354.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2919.2ms, 122 PlacesBefore, 57 PlacesAfterwards, 111 TransitionsBefore, 45 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2364, positive: 2236, positive conditional: 2236, positive unconditional: 0, negative: 128, negative conditional: 128, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1734, positive: 1692, positive conditional: 0, positive unconditional: 1692, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1734, positive: 1692, positive conditional: 0, positive unconditional: 1692, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1734, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 414, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 383, negative conditional: 0, negative unconditional: 383, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2364, positive: 544, positive conditional: 544, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 1734, unknown conditional: 1734, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 92, Positive conditional cache size: 92, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1232.2ms, 53 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 30 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 5 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 829, positive: 676, positive conditional: 676, positive unconditional: 0, negative: 153, negative conditional: 153, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, positive: 174, positive conditional: 9, positive unconditional: 165, negative: 23, negative conditional: 1, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 197, positive: 174, positive conditional: 9, positive unconditional: 165, negative: 23, negative conditional: 1, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 197, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 23, negative conditional: 1, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 233, negative conditional: 26, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 829, positive: 502, positive conditional: 502, positive unconditional: 0, negative: 130, negative conditional: 130, negative unconditional: 0, unknown: 197, unknown conditional: 197, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 175, Positive conditional cache size: 175, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1159.3ms, 47 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 612 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 160, negative conditional: 0, negative unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, positive: 98, positive conditional: 98, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 220, Positive conditional cache size: 220, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 291.0ms, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 8, positive unconditional: 38, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 8, positive unconditional: 38, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 244, negative conditional: 0, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 56, unknown conditional: 56, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 266, Positive conditional cache size: 266, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.5ms, 48 PlacesBefore, 48 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 713 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 280, Positive conditional cache size: 280, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 446.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1880 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 251, positive: 199, positive conditional: 199, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 72, positive conditional: 57, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 72, positive conditional: 57, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 72, positive conditional: 0, positive unconditional: 72, 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: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 251, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 544.1ms, 56 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 908 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 8, positive unconditional: 4, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 8, positive unconditional: 4, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 216, negative conditional: 37, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 318, Positive conditional cache size: 318, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 450.2ms, 64 PlacesBefore, 64 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 1382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2272 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 339, positive: 285, positive conditional: 285, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 74, positive conditional: 62, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, positive: 74, positive conditional: 62, positive unconditional: 12, 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: 74, positive: 74, positive conditional: 0, positive unconditional: 74, 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: 339, positive: 211, positive conditional: 211, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 74, unknown conditional: 74, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 359, Positive conditional cache size: 359, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 468, positive: 404, positive conditional: 404, positive unconditional: 0, negative: 64, negative conditional: 64, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 61, positive conditional: 58, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 61, positive: 61, positive conditional: 58, 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: 61, positive: 61, positive conditional: 0, positive unconditional: 61, 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: 468, positive: 343, positive conditional: 343, positive unconditional: 0, negative: 64, negative conditional: 64, negative unconditional: 0, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 388, Positive conditional cache size: 388, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 834.8ms, 71 PlacesBefore, 67 PlacesAfterwards, 57 TransitionsBefore, 54 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2344 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 442, positive: 364, positive conditional: 364, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 39, 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: 39, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 442, positive: 325, positive conditional: 325, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 375, Positive conditional cache size: 375, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 245.1ms, 64 PlacesBefore, 64 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 197, negative conditional: 67, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 402, Positive conditional cache size: 402, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 537.1ms, 75 PlacesBefore, 75 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 308, positive: 297, positive conditional: 297, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, positive: 247, positive conditional: 247, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 452, Positive conditional cache size: 452, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 323.9ms, 76 PlacesBefore, 76 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 650 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 286, positive conditional: 286, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 299, positive: 274, positive conditional: 274, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 464, Positive conditional cache size: 464, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12559.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2131.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2997.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 81 SDslu, 74 SDs, 0 SdLazy, 338 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 337.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 202.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1507occurred in iteration=11, InterpolantAutomatonStates: 61, 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: 32.9ms SsaConstructionTime, 321.4ms SatisfiabilityAnalysisTime, 555.2ms InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...