/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:09:31,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:09:31,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:09:31,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:09:31,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:09:31,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:09:31,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:09:31,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:09:31,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:09:31,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:09:31,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:09:31,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:09:31,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:09:31,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:09:31,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:09:31,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:09:31,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:09:31,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:09:31,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:09:31,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:09:31,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:09:31,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:09:31,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:09:31,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:09:31,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:09:31,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:09:31,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:09:31,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:09:31,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:09:31,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:09:31,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:09:31,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:09:31,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:09:31,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:09:31,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:09:31,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:09:31,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:09:31,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:09:31,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:09:31,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:09:31,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:09:31,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:09:31,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:09:31,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:09:31,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:09:31,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:09:31,302 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:09:31,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:09:31,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:09:31,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:09:31,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:09:31,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:09:31,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:09:31,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:09:31,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:09:31,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:09:31,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:09:31,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:09:31,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:09:31,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:09:31,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:09:31,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:09:31,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:09:31,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:09:31,307 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:09:31,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:09:31,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:09:31,307 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:09:31,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:09:31,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:09:31,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:09:31,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:09:31,658 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:09:31,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.oepc.i [2021-03-26 10:09:31,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d572a7cd/d9fa17939f5f45c988ccb6f139344d51/FLAGcbef88e3a [2021-03-26 10:09:32,218 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:09:32,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.oepc.i [2021-03-26 10:09:32,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d572a7cd/d9fa17939f5f45c988ccb6f139344d51/FLAGcbef88e3a [2021-03-26 10:09:32,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d572a7cd/d9fa17939f5f45c988ccb6f139344d51 [2021-03-26 10:09:32,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:09:32,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:09:32,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:09:32,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:09:32,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:09:32,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:09:32" (1/1) ... [2021-03-26 10:09:32,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5305c703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:32, skipping insertion in model container [2021-03-26 10:09:32,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:09:32" (1/1) ... [2021-03-26 10:09:32,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:09:32,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:09:32,951 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/mix043_rmo.oepc.i[949,962] [2021-03-26 10:09:33,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:09:33,142 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:09:33,154 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/mix043_rmo.oepc.i[949,962] [2021-03-26 10:09:33,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:09:33,270 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:09:33,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33 WrapperNode [2021-03-26 10:09:33,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:09:33,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:09:33,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:09:33,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:09:33,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:09:33,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:09:33,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:09:33,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:09:33,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... [2021-03-26 10:09:33,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:09:33,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:09:33,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:09:33,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:09:33,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:09:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:09:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:09:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:09:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:09:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:09:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:09:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:09:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:09:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:09:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:09:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:09:33,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:09:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:09:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:09:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:09:33,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:09:33,454 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:09:35,131 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:09:35,131 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:09:35,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:09:35 BoogieIcfgContainer [2021-03-26 10:09:35,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:09:35,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:09:35,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:09:35,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:09:35,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:09:32" (1/3) ... [2021-03-26 10:09:35,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d50f88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:09:35, skipping insertion in model container [2021-03-26 10:09:35,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:33" (2/3) ... [2021-03-26 10:09:35,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d50f88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:09:35, skipping insertion in model container [2021-03-26 10:09:35,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:09:35" (3/3) ... [2021-03-26 10:09:35,138 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_rmo.oepc.i [2021-03-26 10:09:35,144 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:09:35,148 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:09:35,148 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:09:35,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,209 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:35,226 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:09:35,242 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:09:35,259 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:09:35,259 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:09:35,259 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:09:35,259 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:09:35,259 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:09:35,259 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:09:35,259 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:09:35,259 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:09:35,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:09:35,318 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:09:35,319 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:35,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:09:35,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:09:35,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 10:09:35,340 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:35,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:09:35,354 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:09:35,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 10:09:35,383 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:09:35,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:35,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:09:35,387 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-26 10:09:36,788 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:09:37,268 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:09:37,395 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:09:39,023 INFO L154 LiptonReduction]: Checked pairs total: 5194 [2021-03-26 10:09:39,024 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 10:09:39,028 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3689 [2021-03-26 10:09:39,040 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 10:09:39,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:39,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:39,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:39,042 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:39,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:39,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1584989629, now seen corresponding path program 1 times [2021-03-26 10:09:39,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:39,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347101515] [2021-03-26 10:09:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:39,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:39,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:39,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:39,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:39,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347101515] [2021-03-26 10:09:39,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:39,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:09:39,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985247869] [2021-03-26 10:09:39,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:09:39,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:09:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:09:39,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-26 10:09:39,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:39,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:39,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-26 10:09:39,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:39,460 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-26 10:09:39,460 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:39,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2174 event pairs, 110 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-26 10:09:39,467 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 10:09:39,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-26 10:09:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:09:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:09:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 10:09:39,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2021-03-26 10:09:39,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 10:09:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 10:09:39,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:39,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 10:09:39,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:39,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:39,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:39,507 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 538 transitions. [2021-03-26 10:09:39,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-26 10:09:39,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:09:39,511 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 10:09:39,513 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 10:09:39,513 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 10:09:39,513 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:39,514 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 10:09:39,515 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 10:09:39,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 10:09:39,521 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 10:09:39,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:39,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:09:39,524 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-26 10:09:40,592 INFO L154 LiptonReduction]: Checked pairs total: 2761 [2021-03-26 10:09:40,592 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:09:40,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1079 [2021-03-26 10:09:40,594 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 80 flow [2021-03-26 10:09:40,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:40,595 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:40,595 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 10:09:40,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:09:40,595 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1061219016, now seen corresponding path program 1 times [2021-03-26 10:09:40,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:40,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299648024] [2021-03-26 10:09:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:40,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:40,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:40,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:40,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:40,715 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:09:40,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:09:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:40,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299648024] [2021-03-26 10:09:40,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:40,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:40,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451870260] [2021-03-26 10:09:40,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:40,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:40,726 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-26 10:09:40,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:40,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:40,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-26 10:09:40,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:40,768 INFO L129 PetriNetUnfolder]: 7/55 cut-off events. [2021-03-26 10:09:40,768 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:09:40,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 55 events. 7/55 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2021-03-26 10:09:40,769 INFO L132 encePairwiseOnDemand]: 203/208 looper letters, 3 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2021-03-26 10:09:40,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 118 flow [2021-03-26 10:09:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:09:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:09:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 928 transitions. [2021-03-26 10:09:40,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-03-26 10:09:40,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 928 transitions. [2021-03-26 10:09:40,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 928 transitions. [2021-03-26 10:09:40,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:40,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 928 transitions. [2021-03-26 10:09:40,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.6) internal successors, (928), 5 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:40,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:40,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:40,781 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 80 flow. Second operand 5 states and 928 transitions. [2021-03-26 10:09:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 118 flow [2021-03-26 10:09:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:09:40,783 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 97 flow [2021-03-26 10:09:40,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-26 10:09:40,783 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2021-03-26 10:09:40,783 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:40,784 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-26 10:09:40,785 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-26 10:09:40,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 97 flow [2021-03-26 10:09:40,790 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-03-26 10:09:40,790 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:09:40,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 43 events. 3/43 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-26 10:09:40,791 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-26 10:09:41,468 INFO L154 LiptonReduction]: Checked pairs total: 1458 [2021-03-26 10:09:41,468 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:09:41,468 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 685 [2021-03-26 10:09:41,469 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 89 flow [2021-03-26 10:09:41,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:41,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:41,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:41,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:09:41,470 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1042773214, now seen corresponding path program 1 times [2021-03-26 10:09:41,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:41,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940072830] [2021-03-26 10:09:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:41,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:41,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:41,571 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:09:41,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:09:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:41,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940072830] [2021-03-26 10:09:41,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:41,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:09:41,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845429209] [2021-03-26 10:09:41,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:41,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:41,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 213 [2021-03-26 10:09:41,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:41,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:41,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 213 [2021-03-26 10:09:41,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:41,645 INFO L129 PetriNetUnfolder]: 69/211 cut-off events. [2021-03-26 10:09:41,645 INFO L130 PetriNetUnfolder]: For 66/84 co-relation queries the response was YES. [2021-03-26 10:09:41,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 211 events. 69/211 cut-off events. For 66/84 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1052 event pairs, 13 based on Foata normal form. 10/213 useless extension candidates. Maximal degree in co-relation 410. Up to 97 conditions per place. [2021-03-26 10:09:41,647 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 8 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-26 10:09:41,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 129 flow [2021-03-26 10:09:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:09:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:09:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2021-03-26 10:09:41,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8227699530516432 [2021-03-26 10:09:41,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 701 transitions. [2021-03-26 10:09:41,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 701 transitions. [2021-03-26 10:09:41,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:41,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 701 transitions. [2021-03-26 10:09:41,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:41,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:41,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:41,654 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 89 flow. Second operand 4 states and 701 transitions. [2021-03-26 10:09:41,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 129 flow [2021-03-26 10:09:41,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 122 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:09:41,656 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 119 flow [2021-03-26 10:09:41,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-26 10:09:41,657 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places. [2021-03-26 10:09:41,657 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:41,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-26 10:09:41,658 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-26 10:09:41,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 119 flow [2021-03-26 10:09:41,688 INFO L129 PetriNetUnfolder]: 62/216 cut-off events. [2021-03-26 10:09:41,688 INFO L130 PetriNetUnfolder]: For 93/98 co-relation queries the response was YES. [2021-03-26 10:09:41,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 216 events. 62/216 cut-off events. For 93/98 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1188 event pairs, 34 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 412. Up to 93 conditions per place. [2021-03-26 10:09:41,691 INFO L142 LiptonReduction]: Number of co-enabled transitions 498 [2021-03-26 10:09:42,059 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:09:42,211 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:09:42,564 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:09:42,757 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:09:42,777 INFO L154 LiptonReduction]: Checked pairs total: 726 [2021-03-26 10:09:42,778 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:09:42,778 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1121 [2021-03-26 10:09:42,781 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 117 flow [2021-03-26 10:09:42,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:42,782 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:42,784 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:42,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:09:42,784 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1292181937, now seen corresponding path program 1 times [2021-03-26 10:09:42,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:42,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073723283] [2021-03-26 10:09:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:42,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:42,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:42,900 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:09:42,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:09:42,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:42,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:42,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073723283] [2021-03-26 10:09:42,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:42,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:42,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251296445] [2021-03-26 10:09:42,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:42,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:42,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-26 10:09:42,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:42,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:42,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-26 10:09:42,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:43,081 INFO L129 PetriNetUnfolder]: 643/1188 cut-off events. [2021-03-26 10:09:43,081 INFO L130 PetriNetUnfolder]: For 259/318 co-relation queries the response was YES. [2021-03-26 10:09:43,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1188 events. 643/1188 cut-off events. For 259/318 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 8308 event pairs, 314 based on Foata normal form. 72/1025 useless extension candidates. Maximal degree in co-relation 2487. Up to 793 conditions per place. [2021-03-26 10:09:43,093 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-03-26 10:09:43,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 189 flow [2021-03-26 10:09:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:09:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:09:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2021-03-26 10:09:43,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8588785046728972 [2021-03-26 10:09:43,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2021-03-26 10:09:43,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2021-03-26 10:09:43,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:43,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2021-03-26 10:09:43,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:43,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:43,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:43,102 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 117 flow. Second operand 5 states and 919 transitions. [2021-03-26 10:09:43,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 189 flow [2021-03-26 10:09:43,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:09:43,106 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 189 flow [2021-03-26 10:09:43,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-26 10:09:43,107 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2021-03-26 10:09:43,107 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:43,107 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 189 flow [2021-03-26 10:09:43,107 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 189 flow [2021-03-26 10:09:43,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 189 flow [2021-03-26 10:09:43,190 INFO L129 PetriNetUnfolder]: 504/989 cut-off events. [2021-03-26 10:09:43,190 INFO L130 PetriNetUnfolder]: For 808/1083 co-relation queries the response was YES. [2021-03-26 10:09:43,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 989 events. 504/989 cut-off events. For 808/1083 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 6914 event pairs, 245 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 2757. Up to 617 conditions per place. [2021-03-26 10:09:43,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 728 [2021-03-26 10:09:43,617 INFO L154 LiptonReduction]: Checked pairs total: 860 [2021-03-26 10:09:43,617 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:09:43,617 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 510 [2021-03-26 10:09:43,618 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 183 flow [2021-03-26 10:09:43,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:43,619 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:43,619 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:43,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:09:43,619 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1740229324, now seen corresponding path program 1 times [2021-03-26 10:09:43,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:43,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771982874] [2021-03-26 10:09:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:43,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:09:43,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:09:43,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:09:43,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:09:43,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:09:43,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:09:43,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:43,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:09:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:43,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771982874] [2021-03-26 10:09:43,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:43,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:09:43,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36452195] [2021-03-26 10:09:43,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:09:43,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:09:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:09:43,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 214 [2021-03-26 10:09:43,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 183 flow. Second operand has 9 states, 9 states have (on average 140.11111111111111) internal successors, (1261), 9 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:43,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:43,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 214 [2021-03-26 10:09:43,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:45,139 INFO L129 PetriNetUnfolder]: 3912/6419 cut-off events. [2021-03-26 10:09:45,139 INFO L130 PetriNetUnfolder]: For 7031/7518 co-relation queries the response was YES. [2021-03-26 10:09:45,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19008 conditions, 6419 events. 3912/6419 cut-off events. For 7031/7518 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 45968 event pairs, 1313 based on Foata normal form. 233/6232 useless extension candidates. Maximal degree in co-relation 18991. Up to 2313 conditions per place. [2021-03-26 10:09:45,200 INFO L132 encePairwiseOnDemand]: 199/214 looper letters, 51 selfloop transitions, 57 changer transitions 0/126 dead transitions. [2021-03-26 10:09:45,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 126 transitions, 737 flow [2021-03-26 10:09:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 10:09:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 10:09:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1766 transitions. [2021-03-26 10:09:45,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6876947040498442 [2021-03-26 10:09:45,205 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1766 transitions. [2021-03-26 10:09:45,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1766 transitions. [2021-03-26 10:09:45,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:45,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1766 transitions. [2021-03-26 10:09:45,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.16666666666666) internal successors, (1766), 12 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:45,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 214.0) internal successors, (2782), 13 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:45,214 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 214.0) internal successors, (2782), 13 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:45,214 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 183 flow. Second operand 12 states and 1766 transitions. [2021-03-26 10:09:45,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 126 transitions, 737 flow [2021-03-26 10:09:45,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 716 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 10:09:45,300 INFO L241 Difference]: Finished difference. Result has 68 places, 99 transitions, 691 flow [2021-03-26 10:09:45,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=691, PETRI_PLACES=68, PETRI_TRANSITIONS=99} [2021-03-26 10:09:45,300 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2021-03-26 10:09:45,301 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:45,301 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions, 691 flow [2021-03-26 10:09:45,301 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 99 transitions, 691 flow [2021-03-26 10:09:45,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions, 691 flow [2021-03-26 10:09:45,729 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1184] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (mod v_~main$tmp_guard1~0_46 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (ite (= (ite (not (and (= v_~z~0_57 2) (= v_~__unbuffered_p3_EAX~0_48 1) (= v_~__unbuffered_p0_EAX~0_52 0) (= 0 v_~__unbuffered_p3_EBX~0_71) (= v_~__unbuffered_p1_EAX~0_50 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][71], [Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 141#(= ~z~0 0), 148#true, 25#L847true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 28#L815true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 157#(= ~__unbuffered_cnt~0 0), 165#true, 114#L775true, 56#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), 126#P1EXITtrue, Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:45,729 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,729 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,730 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,730 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,766 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1184] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (mod v_~main$tmp_guard1~0_46 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (ite (= (ite (not (and (= v_~z~0_57 2) (= v_~__unbuffered_p3_EAX~0_48 1) (= v_~__unbuffered_p0_EAX~0_52 0) (= 0 v_~__unbuffered_p3_EBX~0_71) (= v_~__unbuffered_p1_EAX~0_50 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][71], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 141#(= ~z~0 0), 148#true, 25#L847true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 28#L815true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 157#(= ~__unbuffered_cnt~0 0), 165#true, 114#L775true, 56#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), 126#P1EXITtrue, Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:45,767 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,767 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,767 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,767 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,767 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:45,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1184] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (mod v_~main$tmp_guard1~0_46 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (ite (= (ite (not (and (= v_~z~0_57 2) (= v_~__unbuffered_p3_EAX~0_48 1) (= v_~__unbuffered_p0_EAX~0_52 0) (= 0 v_~__unbuffered_p3_EBX~0_71) (= v_~__unbuffered_p1_EAX~0_50 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][71], [Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 78#L854true, Black: 141#(= ~z~0 0), 148#true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 28#L815true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 157#(= ~__unbuffered_cnt~0 0), 165#true, 114#L775true, 56#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), 126#P1EXITtrue, Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:45,771 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 10:09:45,771 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:45,771 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:45,771 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:45,812 INFO L129 PetriNetUnfolder]: 2338/4313 cut-off events. [2021-03-26 10:09:45,812 INFO L130 PetriNetUnfolder]: For 9481/10405 co-relation queries the response was YES. [2021-03-26 10:09:45,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14961 conditions, 4313 events. 2338/4313 cut-off events. For 9481/10405 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 34855 event pairs, 854 based on Foata normal form. 47/3839 useless extension candidates. Maximal degree in co-relation 14935. Up to 2267 conditions per place. [2021-03-26 10:09:45,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 1348 [2021-03-26 10:09:46,262 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:46,418 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:46,736 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:46,855 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:47,332 INFO L154 LiptonReduction]: Checked pairs total: 623 [2021-03-26 10:09:47,332 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:09:47,332 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2031 [2021-03-26 10:09:47,334 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 99 transitions, 695 flow [2021-03-26 10:09:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 140.11111111111111) internal successors, (1261), 9 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:47,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:47,335 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:47,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:09:47,335 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash -733019417, now seen corresponding path program 1 times [2021-03-26 10:09:47,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:47,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884990845] [2021-03-26 10:09:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:47,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:47,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:47,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:47,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:47,434 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:09:47,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:09:47,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:47,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:47,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884990845] [2021-03-26 10:09:47,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:47,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:09:47,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143411215] [2021-03-26 10:09:47,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:09:47,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:09:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:09:47,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216 [2021-03-26 10:09:47,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 99 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:47,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:47,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216 [2021-03-26 10:09:47,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:47,587 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][53], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, 198#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 88#L878-1true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), 157#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 40#L765true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, 60#L831true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:47,587 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 10:09:47,587 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:47,587 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:47,587 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:47,618 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][53], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, 198#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 88#L878-1true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), 157#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, 51#L768true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), 60#L831true, Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:47,619 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-26 10:09:47,619 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:47,619 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:47,619 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:48,019 INFO L129 PetriNetUnfolder]: 2035/3903 cut-off events. [2021-03-26 10:09:48,019 INFO L130 PetriNetUnfolder]: For 8042/12380 co-relation queries the response was YES. [2021-03-26 10:09:48,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14652 conditions, 3903 events. 2035/3903 cut-off events. For 8042/12380 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 31741 event pairs, 237 based on Foata normal form. 749/4155 useless extension candidates. Maximal degree in co-relation 14624. Up to 2421 conditions per place. [2021-03-26 10:09:48,074 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 13 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2021-03-26 10:09:48,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 809 flow [2021-03-26 10:09:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:09:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:09:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1105 transitions. [2021-03-26 10:09:48,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8526234567901234 [2021-03-26 10:09:48,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1105 transitions. [2021-03-26 10:09:48,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1105 transitions. [2021-03-26 10:09:48,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:48,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1105 transitions. [2021-03-26 10:09:48,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:48,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:48,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:48,082 INFO L185 Difference]: Start difference. First operand has 68 places, 99 transitions, 695 flow. Second operand 6 states and 1105 transitions. [2021-03-26 10:09:48,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 809 flow [2021-03-26 10:09:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 795 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-26 10:09:48,097 INFO L241 Difference]: Finished difference. Result has 76 places, 106 transitions, 781 flow [2021-03-26 10:09:48,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=781, PETRI_PLACES=76, PETRI_TRANSITIONS=106} [2021-03-26 10:09:48,097 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2021-03-26 10:09:48,098 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:48,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 106 transitions, 781 flow [2021-03-26 10:09:48,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 106 transitions, 781 flow [2021-03-26 10:09:48,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 106 transitions, 781 flow [2021-03-26 10:09:48,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1184] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (mod v_~main$tmp_guard1~0_46 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|) (= (ite (= (ite (not (and (= v_~z~0_57 2) (= v_~__unbuffered_p3_EAX~0_48 1) (= v_~__unbuffered_p0_EAX~0_52 0) (= 0 v_~__unbuffered_p3_EBX~0_71) (= v_~__unbuffered_p1_EAX~0_50 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_57, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_71, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_31|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][76], [Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, 196#true, P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), Black: 200#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 202#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 141#(= ~z~0 0), 148#true, 25#L847true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 157#(= ~__unbuffered_cnt~0 0), 165#true, 114#L775true, 53#P2EXITtrue, 56#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), 126#P1EXITtrue, Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:48,432 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 10:09:48,432 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:48,432 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:48,432 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:09:48,448 INFO L129 PetriNetUnfolder]: 1455/3027 cut-off events. [2021-03-26 10:09:48,448 INFO L130 PetriNetUnfolder]: For 9283/10367 co-relation queries the response was YES. [2021-03-26 10:09:48,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13617 conditions, 3027 events. 1455/3027 cut-off events. For 9283/10367 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 25065 event pairs, 196 based on Foata normal form. 127/2933 useless extension candidates. Maximal degree in co-relation 13586. Up to 1918 conditions per place. [2021-03-26 10:09:48,497 INFO L142 LiptonReduction]: Number of co-enabled transitions 1766 [2021-03-26 10:09:50,329 INFO L154 LiptonReduction]: Checked pairs total: 629 [2021-03-26 10:09:50,329 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:09:50,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2231 [2021-03-26 10:09:50,329 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 105 transitions, 773 flow [2021-03-26 10:09:50,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:50,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:50,331 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 10:09:50,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:09:50,331 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1475907081, now seen corresponding path program 1 times [2021-03-26 10:09:50,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:50,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327596556] [2021-03-26 10:09:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:50,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:50,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:50,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:50,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:50,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:50,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:50,443 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:09:50,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:09:50,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:50,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:50,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327596556] [2021-03-26 10:09:50,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:50,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:09:50,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739074356] [2021-03-26 10:09:50,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:09:50,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:09:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:09:50,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216 [2021-03-26 10:09:50,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 105 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:50,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:50,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216 [2021-03-26 10:09:50,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:50,559 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][52], [Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, 198#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), Black: 200#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 202#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 209#(= ~__unbuffered_cnt~0 0), Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 88#L878-1true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), 157#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 40#L765true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), 60#L831true, Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:50,559 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 10:09:50,559 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:50,559 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:50,559 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:50,583 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][52], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, 198#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), Black: 200#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 202#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 209#(= ~__unbuffered_cnt~0 0), Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 88#L878-1true, Black: 150#(= ~__unbuffered_p3_EAX~0 0), 157#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, 51#L768true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), 60#L831true, Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:50,583 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-26 10:09:50,583 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:50,583 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:50,583 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:50,840 INFO L129 PetriNetUnfolder]: 1417/2725 cut-off events. [2021-03-26 10:09:50,840 INFO L130 PetriNetUnfolder]: For 9789/13886 co-relation queries the response was YES. [2021-03-26 10:09:50,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12436 conditions, 2725 events. 1417/2725 cut-off events. For 9789/13886 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 20334 event pairs, 60 based on Foata normal form. 672/3016 useless extension candidates. Maximal degree in co-relation 12403. Up to 1670 conditions per place. [2021-03-26 10:09:50,879 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 10 selfloop transitions, 18 changer transitions 4/117 dead transitions. [2021-03-26 10:09:50,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 929 flow [2021-03-26 10:09:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:09:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:09:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2021-03-26 10:09:50,883 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2021-03-26 10:09:50,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1287 transitions. [2021-03-26 10:09:50,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1287 transitions. [2021-03-26 10:09:50,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:50,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1287 transitions. [2021-03-26 10:09:50,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.85714285714286) internal successors, (1287), 7 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:50,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:50,888 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:50,888 INFO L185 Difference]: Start difference. First operand has 76 places, 105 transitions, 773 flow. Second operand 7 states and 1287 transitions. [2021-03-26 10:09:50,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 929 flow [2021-03-26 10:09:51,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 867 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:09:51,003 INFO L241 Difference]: Finished difference. Result has 79 places, 110 transitions, 833 flow [2021-03-26 10:09:51,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=79, PETRI_TRANSITIONS=110} [2021-03-26 10:09:51,004 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 18 predicate places. [2021-03-26 10:09:51,004 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:51,004 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 110 transitions, 833 flow [2021-03-26 10:09:51,004 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 110 transitions, 833 flow [2021-03-26 10:09:51,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 110 transitions, 833 flow [2021-03-26 10:09:51,160 INFO L129 PetriNetUnfolder]: 786/1771 cut-off events. [2021-03-26 10:09:51,160 INFO L130 PetriNetUnfolder]: For 4412/4629 co-relation queries the response was YES. [2021-03-26 10:09:51,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7362 conditions, 1771 events. 786/1771 cut-off events. For 4412/4629 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 13397 event pairs, 44 based on Foata normal form. 9/1702 useless extension candidates. Maximal degree in co-relation 7330. Up to 901 conditions per place. [2021-03-26 10:09:51,202 INFO L142 LiptonReduction]: Number of co-enabled transitions 1632 [2021-03-26 10:09:51,487 INFO L154 LiptonReduction]: Checked pairs total: 613 [2021-03-26 10:09:51,487 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:09:51,487 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 483 [2021-03-26 10:09:51,489 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 109 transitions, 823 flow [2021-03-26 10:09:51,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:51,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:51,490 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 10:09:51,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:09:51,491 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1347034546, now seen corresponding path program 1 times [2021-03-26 10:09:51,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:51,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046019689] [2021-03-26 10:09:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:51,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:51,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:51,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:51,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:51,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:51,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:51,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:51,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:51,619 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:09:51,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:09:51,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:51,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:51,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046019689] [2021-03-26 10:09:51,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:51,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:09:51,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49134779] [2021-03-26 10:09:51,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:09:51,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:09:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:09:51,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216 [2021-03-26 10:09:51,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 109 transitions, 823 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:51,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:51,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216 [2021-03-26 10:09:51,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:51,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][52], [Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), P1Thread1of1ForFork2InUse, Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), 209#(= ~__unbuffered_cnt~0 0), Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= ~__unbuffered_cnt~0 2), 88#L878-1true, Black: 212#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 214#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 157#(= ~__unbuffered_cnt~0 0), 221#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 40#L765true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), 60#L831true, Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:51,726 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 10:09:51,726 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:51,727 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:51,727 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 10:09:51,751 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L805-->L808: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0][52], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), 209#(= ~__unbuffered_cnt~0 0), Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= ~__unbuffered_cnt~0 2), 88#L878-1true, Black: 212#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 214#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 157#(= ~__unbuffered_cnt~0 0), 221#(= ~__unbuffered_cnt~0 0), 30#L795true, Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 110#L808true, 51#L768true, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 179#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), 60#L831true, Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:51,751 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-26 10:09:51,751 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:51,751 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:51,751 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 10:09:51,955 INFO L129 PetriNetUnfolder]: 1272/2342 cut-off events. [2021-03-26 10:09:51,955 INFO L130 PetriNetUnfolder]: For 6683/9218 co-relation queries the response was YES. [2021-03-26 10:09:51,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 2342 events. 1272/2342 cut-off events. For 6683/9218 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 16498 event pairs, 46 based on Foata normal form. 321/2291 useless extension candidates. Maximal degree in co-relation 9624. Up to 1046 conditions per place. [2021-03-26 10:09:51,982 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 18 changer transitions 5/114 dead transitions. [2021-03-26 10:09:51,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 114 transitions, 889 flow [2021-03-26 10:09:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:09:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:09:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1463 transitions. [2021-03-26 10:09:51,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8466435185185185 [2021-03-26 10:09:51,986 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1463 transitions. [2021-03-26 10:09:51,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1463 transitions. [2021-03-26 10:09:51,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:51,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1463 transitions. [2021-03-26 10:09:51,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:51,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:51,992 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:51,992 INFO L185 Difference]: Start difference. First operand has 79 places, 109 transitions, 823 flow. Second operand 8 states and 1463 transitions. [2021-03-26 10:09:51,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 114 transitions, 889 flow [2021-03-26 10:09:52,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 114 transitions, 823 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-03-26 10:09:52,075 INFO L241 Difference]: Finished difference. Result has 81 places, 106 transitions, 769 flow [2021-03-26 10:09:52,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2021-03-26 10:09:52,075 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2021-03-26 10:09:52,076 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:52,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 106 transitions, 769 flow [2021-03-26 10:09:52,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 106 transitions, 769 flow [2021-03-26 10:09:52,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 106 transitions, 769 flow [2021-03-26 10:09:52,170 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L815-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1)) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset][81], [P1Thread1of1ForFork2InUse, Black: 170#(and (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$r_buff0_thd3~0 0) (not (= ~b$w_buff1~0 ~b$w_buff0~0)) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd0~0 0)), Black: 171#(and (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 175#(and (= ~b$w_buff0~0 0) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(<= ~__unbuffered_cnt~0 1), 207#true, 80#P3EXITtrue, Black: 141#(= ~z~0 0), 151#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= ~__unbuffered_cnt~0 2), 88#L878-1true, 30#L795true, 224#(<= ~__unbuffered_cnt~0 3), Black: 160#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 157#(= ~__unbuffered_cnt~0 0), Black: 225#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 227#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#P2EXITtrue, Black: 177#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$w_buff1~0 ~b~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 165#true, 59#P0EXITtrue, Black: 181#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~b$r_buff0_thd0~0 0)), Black: 183#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~__unbuffered_p1_EAX~0 1) (= ~b$r_buff0_thd0~0 0)), Black: 167#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0)), Black: 168#(and (= ~b$w_buff0~0 0) (= ~y~0 1) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~b~0) (= ~b$r_buff0_thd0~0 0))]) [2021-03-26 10:09:52,170 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 10:09:52,170 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:52,170 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:52,171 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:09:52,179 INFO L129 PetriNetUnfolder]: 671/1417 cut-off events. [2021-03-26 10:09:52,179 INFO L130 PetriNetUnfolder]: For 2718/2869 co-relation queries the response was YES. [2021-03-26 10:09:52,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 1417 events. 671/1417 cut-off events. For 2718/2869 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9904 event pairs, 42 based on Foata normal form. 4/1339 useless extension candidates. Maximal degree in co-relation 5409. Up to 455 conditions per place. [2021-03-26 10:09:52,196 INFO L142 LiptonReduction]: Number of co-enabled transitions 1352 [2021-03-26 10:09:52,452 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:52,606 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:09:52,740 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:09:52,843 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:09:52,974 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:09:53,119 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:09:53,131 INFO L154 LiptonReduction]: Checked pairs total: 794 [2021-03-26 10:09:53,131 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:09:53,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1056 [2021-03-26 10:09:53,132 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 103 transitions, 753 flow [2021-03-26 10:09:53,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:53,133 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 10:09:53,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:09:53,133 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash -586010405, now seen corresponding path program 1 times [2021-03-26 10:09:53,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:53,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633233331] [2021-03-26 10:09:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:53,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:53,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:53,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:53,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:53,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:53,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:53,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633233331] [2021-03-26 10:09:53,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:53,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:53,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612982554] [2021-03-26 10:09:53,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:53,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:53,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 218 [2021-03-26 10:09:53,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 103 transitions, 753 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:53,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 218 [2021-03-26 10:09:53,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:53,420 INFO L129 PetriNetUnfolder]: 770/1640 cut-off events. [2021-03-26 10:09:53,420 INFO L130 PetriNetUnfolder]: For 7884/8358 co-relation queries the response was YES. [2021-03-26 10:09:53,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 1640 events. 770/1640 cut-off events. For 7884/8358 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 12300 event pairs, 60 based on Foata normal form. 83/1620 useless extension candidates. Maximal degree in co-relation 6195. Up to 485 conditions per place. [2021-03-26 10:09:53,433 INFO L132 encePairwiseOnDemand]: 215/218 looper letters, 6 selfloop transitions, 3 changer transitions 29/105 dead transitions. [2021-03-26 10:09:53,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 801 flow [2021-03-26 10:09:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:09:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:09:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 742 transitions. [2021-03-26 10:09:53,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8509174311926605 [2021-03-26 10:09:53,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 742 transitions. [2021-03-26 10:09:53,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 742 transitions. [2021-03-26 10:09:53,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:53,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 742 transitions. [2021-03-26 10:09:53,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,440 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,440 INFO L185 Difference]: Start difference. First operand has 77 places, 103 transitions, 753 flow. Second operand 4 states and 742 transitions. [2021-03-26 10:09:53,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 801 flow [2021-03-26 10:09:53,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 726 flow, removed 22 selfloop flow, removed 8 redundant places. [2021-03-26 10:09:53,484 INFO L241 Difference]: Finished difference. Result has 74 places, 76 transitions, 499 flow [2021-03-26 10:09:53,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2021-03-26 10:09:53,484 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2021-03-26 10:09:53,484 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:53,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 76 transitions, 499 flow [2021-03-26 10:09:53,485 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 76 transitions, 499 flow [2021-03-26 10:09:53,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 76 transitions, 499 flow [2021-03-26 10:09:53,548 INFO L129 PetriNetUnfolder]: 296/692 cut-off events. [2021-03-26 10:09:53,548 INFO L130 PetriNetUnfolder]: For 1526/1610 co-relation queries the response was YES. [2021-03-26 10:09:53,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 692 events. 296/692 cut-off events. For 1526/1610 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4546 event pairs, 31 based on Foata normal form. 23/662 useless extension candidates. Maximal degree in co-relation 2174. Up to 180 conditions per place. [2021-03-26 10:09:53,558 INFO L142 LiptonReduction]: Number of co-enabled transitions 876 [2021-03-26 10:09:53,600 INFO L154 LiptonReduction]: Checked pairs total: 197 [2021-03-26 10:09:53,601 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:09:53,601 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-26 10:09:53,602 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 499 flow [2021-03-26 10:09:53,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:53,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:53,602 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 10:09:53,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:09:53,603 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1667781804, now seen corresponding path program 1 times [2021-03-26 10:09:53,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:53,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911624092] [2021-03-26 10:09:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:09:53,677 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:09:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:09:53,772 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:09:53,816 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:09:53,816 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:09:53,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:09:53,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:09:53 BasicIcfg [2021-03-26 10:09:53,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:09:53,940 INFO L168 Benchmark]: Toolchain (without parser) took 21191.61 ms. Allocated memory was 255.9 MB in the beginning and 746.6 MB in the end (delta: 490.7 MB). Free memory was 232.3 MB in the beginning and 342.7 MB in the end (delta: -110.4 MB). Peak memory consumption was 380.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,940 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:09:53,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.16 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 231.7 MB in the beginning and 309.8 MB in the end (delta: -78.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 352.3 MB. Free memory was 309.8 MB in the beginning and 307.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,941 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 ms. Allocated memory is still 352.3 MB. Free memory was 307.7 MB in the beginning and 304.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,942 INFO L168 Benchmark]: RCFGBuilder took 1770.43 ms. Allocated memory is still 352.3 MB. Free memory was 304.9 MB in the beginning and 278.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,942 INFO L168 Benchmark]: TraceAbstraction took 18805.04 ms. Allocated memory was 352.3 MB in the beginning and 746.6 MB in the end (delta: 394.3 MB). Free memory was 278.4 MB in the beginning and 342.7 MB in the end (delta: -64.3 MB). Peak memory consumption was 331.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:53,947 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.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 519.16 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 231.7 MB in the beginning and 309.8 MB in the end (delta: -78.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 352.3 MB. Free memory was 309.8 MB in the beginning and 307.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.84 ms. Allocated memory is still 352.3 MB. Free memory was 307.7 MB in the beginning and 304.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1770.43 ms. Allocated memory is still 352.3 MB. Free memory was 304.9 MB in the beginning and 278.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18805.04 ms. Allocated memory was 352.3 MB in the beginning and 746.6 MB in the end (delta: 394.3 MB). Free memory was 278.4 MB in the beginning and 342.7 MB in the end (delta: -64.3 MB). Peak memory consumption was 331.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3670.0ms, 127 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2703, positive: 2592, positive conditional: 2592, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2703, positive: 2592, positive conditional: 0, positive unconditional: 2592, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2703, positive: 2592, positive conditional: 0, positive unconditional: 2592, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1967, positive: 1914, positive conditional: 0, positive unconditional: 1914, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1967, positive: 1897, positive conditional: 0, positive unconditional: 1897, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 741, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 687, negative conditional: 0, negative unconditional: 687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2703, positive: 678, positive conditional: 0, positive unconditional: 678, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1967, unknown conditional: 0, unknown unconditional: 1967] , Statistics on independence cache: Total cache size (in pairs): 1967, Positive cache size: 1914, Positive conditional cache size: 0, Positive unconditional cache size: 1914, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1077.2ms, 57 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 34 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2761 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 945, positive: 821, positive conditional: 821, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 945, positive: 821, positive conditional: 45, positive unconditional: 776, negative: 124, negative conditional: 4, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 945, positive: 821, positive conditional: 45, positive unconditional: 776, negative: 124, negative conditional: 4, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, positive: 218, positive conditional: 12, positive unconditional: 206, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, positive: 203, positive conditional: 0, positive unconditional: 203, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 260, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 202, negative conditional: 17, negative unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 945, positive: 603, positive conditional: 33, positive unconditional: 570, negative: 104, negative conditional: 3, negative unconditional: 101, unknown: 238, unknown conditional: 13, unknown unconditional: 225] , Statistics on independence cache: Total cache size (in pairs): 2205, Positive cache size: 2132, Positive conditional cache size: 12, Positive unconditional cache size: 2120, Negative cache size: 73, Negative conditional cache size: 1, Negative unconditional cache size: 72, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 683.3ms, 49 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1458 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 493, positive: 423, positive conditional: 423, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 493, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 493, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 21, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 493, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 2226, Positive cache size: 2151, Positive conditional cache size: 12, Positive unconditional cache size: 2139, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1119.9ms, 45 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 226, positive: 177, positive conditional: 0, positive unconditional: 177, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 2241, Positive cache size: 2166, Positive conditional cache size: 12, Positive unconditional cache size: 2154, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 509.6ms, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 860 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 96, positive conditional: 14, positive unconditional: 82, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 96, positive conditional: 14, positive unconditional: 82, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 11, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 83, positive conditional: 3, positive unconditional: 80, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 13, unknown conditional: 11, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2254, Positive cache size: 2179, Positive conditional cache size: 23, Positive unconditional cache size: 2156, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2031.2ms, 68 PlacesBefore, 68 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 1348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 623 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, positive: 108, positive conditional: 34, positive unconditional: 74, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, positive: 108, positive conditional: 34, positive unconditional: 74, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 5, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 128, positive: 94, positive conditional: 29, positive unconditional: 65, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2193, Positive conditional cache size: 28, Positive unconditional cache size: 2165, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 68 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2230.8ms, 76 PlacesBefore, 76 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 629 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 54, positive conditional: 52, positive unconditional: 2, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 54, positive conditional: 52, positive unconditional: 2, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 54, positive conditional: 52, positive unconditional: 2, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2193, Positive conditional cache size: 28, Positive unconditional cache size: 2165, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 482.8ms, 79 PlacesBefore, 79 PlacesAfterwards, 110 TransitionsBefore, 109 TransitionsAfterwards, 1632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 613 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2193, Positive conditional cache size: 28, Positive unconditional cache size: 2165, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1055.5ms, 81 PlacesBefore, 77 PlacesAfterwards, 106 TransitionsBefore, 103 TransitionsAfterwards, 1352 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 794 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2193, Positive conditional cache size: 28, Positive unconditional cache size: 2165, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 116.0ms, 74 PlacesBefore, 70 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 10, positive conditional: 6, positive unconditional: 4, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2273, Positive cache size: 2197, Positive conditional cache size: 30, Positive unconditional cache size: 2167, Negative cache size: 76, Negative conditional cache size: 1, Negative unconditional cache size: 75, Eliminated conditions: 9 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1145; [L872] FCALL, FORK 0 pthread_create(&t1145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1146; [L874] FCALL, FORK 0 pthread_create(&t1146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1147; [L876] FCALL, FORK 0 pthread_create(&t1147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1148; [L878] FCALL, FORK 0 pthread_create(&t1148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=2] [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18561.4ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3906.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3776.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 65 SDtfs, 72 SDslu, 64 SDs, 0 SdLazy, 385 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 416.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 327.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=833occurred in iteration=7, InterpolantAutomatonStates: 54, 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: 35.0ms SsaConstructionTime, 503.6ms SatisfiabilityAnalysisTime, 676.3ms InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...